./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label06_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_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 23:27:10,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:27:10,954 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:27:10,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:27:10,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:27:10,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:27:10,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:27:10,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:27:10,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:27:10,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:27:10,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:27:10,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:27:10,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:27:10,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:27:10,968 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:27:10,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:27:10,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:27:10,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:27:10,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:27:10,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:27:10,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:27:10,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:27:10,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:27:10,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:27:10,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:27:10,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:27:10,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:27:10,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:27:10,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:27:10,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:27:10,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:27:10,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:27:10,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:27:10,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:27:10,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:27:10,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:27:10,982 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-09 23:27:10,991 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:27:10,991 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:27:10,992 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:27:10,992 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:27:10,992 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:27:10,993 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 23:27:10,993 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 23:27:10,993 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 23:27:10,993 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 23:27:10,993 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 23:27:10,993 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 23:27:10,993 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:27:10,993 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 23:27:10,994 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 23:27:10,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:27:10,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 23:27:10,994 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:27:10,994 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 23:27:10,994 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 23:27:10,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 23:27:10,994 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 23:27:10,995 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 23:27:10,995 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 23:27:10,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 23:27:10,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:27:10,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:27:10,995 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 23:27:10,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:27:10,996 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:27:10,996 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 23:27:10,996 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 23:27:10,996 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_86be3f58-1cd1-4bee-a549-303e58476124/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 -> 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 [2018-11-09 23:27:11,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:27:11,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:27:11,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:27:11,028 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:27:11,029 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:27:11,029 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-09 23:27:11,062 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/data/94b6f0aae/9ec38cffebbe49fc94aeb8e275b13bbd/FLAG6032d093e [2018-11-09 23:27:11,430 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:27:11,431 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-09 23:27:11,440 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/data/94b6f0aae/9ec38cffebbe49fc94aeb8e275b13bbd/FLAG6032d093e [2018-11-09 23:27:11,450 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/data/94b6f0aae/9ec38cffebbe49fc94aeb8e275b13bbd [2018-11-09 23:27:11,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:27:11,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 23:27:11,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:27:11,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:27:11,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:27:11,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11, skipping insertion in model container [2018-11-09 23:27:11,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:27:11,498 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:27:11,713 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:27:11,716 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:27:11,781 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:27:11,794 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:27:11,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11 WrapperNode [2018-11-09 23:27:11,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:27:11,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 23:27:11,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 23:27:11,795 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 23:27:11,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 23:27:11,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:27:11,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:27:11,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:27:11,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... [2018-11-09 23:27:11,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:27:11,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:27:11,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:27:11,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:27:11,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:11,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:27:11,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:27:12,698 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:27:12,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:27:12 BoogieIcfgContainer [2018-11-09 23:27:12,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:27:12,699 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 23:27:12,700 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 23:27:12,703 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 23:27:12,703 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:27:12,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 11:27:11" (1/3) ... [2018-11-09 23:27:12,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4de8571e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:27:12, skipping insertion in model container [2018-11-09 23:27:12,704 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:27:12,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:11" (2/3) ... [2018-11-09 23:27:12,705 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4de8571e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:27:12, skipping insertion in model container [2018-11-09 23:27:12,705 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:27:12,705 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:27:12" (3/3) ... [2018-11-09 23:27:12,706 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-11-09 23:27:12,738 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:27:12,739 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 23:27:12,739 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 23:27:12,739 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 23:27:12,739 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:27:12,739 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:27:12,739 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 23:27:12,739 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:27:12,739 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 23:27:12,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-09 23:27:12,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-09 23:27:12,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:12,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:12,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 23:27:12,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:27:12,782 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 23:27:12,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-09 23:27:12,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-09 23:27:12,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:12,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:12,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 23:27:12,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 23:27:12,794 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-09 23:27:12,794 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-09 23:27:12,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:12,798 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-09 23:27:12,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:12,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:12,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:12,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:12,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:12,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-09 23:27:12,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:12,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:12,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-09 23:27:12,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:12,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:12,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:12,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:12,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:27:12,965 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-09 23:27:12,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:27:12,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 23:27:13,110 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-09 23:27:13,156 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:27:13,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:27:13,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:27:13,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:27:13,157 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:27:13,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:27:13,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:27:13,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:27:13,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-09 23:27:13,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:27:13,158 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:27:13,182 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-09 23:27:13,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-09 23:27:13,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-09 23:27:13,231 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-09 23:27:13,237 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-09 23:27:13,240 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-09 23:27:13,242 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-09 23:27:13,250 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-09 23:27:13,466 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:27:13,467 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:13,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:13,495 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:13,495 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:13,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:13,503 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:13,503 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:13,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:13,555 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:13,555 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:13,563 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:13,591 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:13,591 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:13,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:13,627 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:13,627 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:13,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:13,649 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:13,649 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:13,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:13,687 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:13,687 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:13,708 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:13,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:27:13,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:13,778 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:27:13,779 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:27:13,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:27:13,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:27:13,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:27:13,780 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:27:13,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:27:13,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:27:13,781 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:27:13,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-09 23:27:13,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:27:13,781 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:27:13,784 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-09 23:27:13,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:13,798 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-09 23:27:13,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:13,823 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-09 23:27:13,825 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-09 23:27:13,827 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-09 23:27:13,830 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-09 23:27:13,987 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:27:13,990 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:27:13,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:13,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:13,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:13,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:13,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:13,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:13,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:13,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:14,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:14,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,010 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:14,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:14,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:14,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:14,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:14,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:14,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:14,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:14,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:14,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,048 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:14,049 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,053 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-09 23:27:14,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,055 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,056 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,064 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,064 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,068 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,068 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,070 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-09 23:27:14,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,086 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,087 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,092 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,092 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,096 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,096 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,100 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,100 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,102 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,102 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,107 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-09 23:27:14,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,109 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,110 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,118 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,118 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,122 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,122 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,124 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-09 23:27:14,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,168 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,168 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,173 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,174 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,179 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,181 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,181 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,182 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:14,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,186 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-09 23:27:14,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,187 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,188 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,195 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,195 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,199 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,199 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,201 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-09 23:27:14,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,211 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,212 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,216 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,216 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,219 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,219 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,222 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,222 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:14,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,224 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,224 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,224 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-09 23:27:14,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,228 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-09 23:27:14,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,229 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,229 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,230 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,242 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,242 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,243 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,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-09 23:27:14,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,246 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,246 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,246 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,248 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-09 23:27:14,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,271 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,272 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,273 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,276 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,276 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,276 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,279 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,279 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,280 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,280 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,283 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,283 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,283 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,284 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:14,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,285 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,285 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,286 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:14,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,291 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-09 23:27:14,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,292 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,292 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:14,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,292 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,293 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,306 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,306 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:14,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,306 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,307 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,310 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:14,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,311 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,311 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,313 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-09 23:27:14,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,337 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,337 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:14,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,337 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,338 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,343 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:14,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,344 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,344 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,348 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:14,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,349 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,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-09 23:27:14,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,353 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:14,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,353 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,354 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,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-09 23:27:14,356 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,356 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:14,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,356 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,356 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,357 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:14,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,363 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-09 23:27:14,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-09 23:27:14,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,364 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,365 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,367 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,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-09 23:27:14,374 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,374 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,375 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,375 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,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-09 23:27:14,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,380 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,381 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,381 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,384 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-09 23:27:14,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,414 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,414 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,415 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,423 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,423 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,424 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,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-09 23:27:14,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,429 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,429 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,430 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,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-09 23:27:14,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,435 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,436 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,438 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:14,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,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-09 23:27:14,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,439 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,440 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:14,441 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-09 23:27:14,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,450 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-09 23:27:14,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-09 23:27:14,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,450 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,451 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,460 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,460 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,460 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,463 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,463 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,463 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,463 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,464 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-09 23:27:14,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,480 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,480 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,480 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,485 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,485 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,486 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,488 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,491 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,492 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,492 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:14,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,494 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:14,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,494 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,494 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:14,495 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:14,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,500 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-09 23:27:14,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,501 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,501 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:14,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,527 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,527 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:14,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,531 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,532 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-09 23:27:14,532 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:14,534 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-09 23:27:14,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,595 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,595 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:14,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,605 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,605 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:14,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,609 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:14,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,615 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:14,615 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:14,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:14,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:14,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:14,618 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:14,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:14,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:14,619 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:14,619 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:14,620 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-09 23:27:14,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:14,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:14,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:27:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:27:14,638 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-09 23:27:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:27:15,145 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-09 23:27:15,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:27:15,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-09 23:27:15,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-09 23:27:15,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-09 23:27:15,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-09 23:27:15,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-09 23:27:15,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-09 23:27:15,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:27:15,159 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-09 23:27:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-09 23:27:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-09 23:27:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-09 23:27:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-09 23:27:15,186 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-09 23:27:15,186 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-09 23:27:15,186 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 23:27:15,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-09 23:27:15,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-09 23:27:15,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:15,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:15,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 23:27:15,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:27:15,188 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-09 23:27:15,188 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 866#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 979#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; 884#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); 885#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); 695#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 696#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 852#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-09 23:27:15,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-09 23:27:15,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:15,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:15,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:15,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:15,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-09 23:27:15,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:15,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:15,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:15,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:27:15,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:15,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:15,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-09 23:27:15,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:15,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:15,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:15,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:27:15,238 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-09 23:27:15,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:27:15,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 23:27:15,309 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:27:15,309 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:27:15,309 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:27:15,309 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:27:15,309 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:27:15,309 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:27:15,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:27:15,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:27:15,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-09 23:27:15,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:27:15,309 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:27:15,311 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-09 23:27:15,314 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-09 23:27:15,317 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-09 23:27:15,319 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-09 23:27:15,320 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-09 23:27:15,323 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-09 23:27:15,326 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-09 23:27:15,331 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-09 23:27:15,432 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:27:15,432 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:15,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:15,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:15,464 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:15,464 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:15,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:15,485 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:15,491 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:15,491 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:15,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:15,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:15,522 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:15,522 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:15,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:15,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:15,554 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:15,555 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:15,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:15,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:15,591 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:15,591 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:15,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:15,595 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:15,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:27:15,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:15,646 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 23:27:15,648 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:27:15,648 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:27:15,648 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:27:15,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:27:15,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:27:15,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:27:15,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:27:15,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:27:15,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-09 23:27:15,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:27:15,648 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:27:15,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:15,653 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-09 23:27:15,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:15,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-09 23:27:15,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-09 23:27:15,662 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-09 23:27:15,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:15,675 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-09 23:27:15,899 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:27:15,899 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:27:15,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:15,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:15,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:15,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:15,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,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-09 23:27:15,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,905 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:15,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:15,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:15,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:15,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:15,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:15,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,909 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:15,909 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:15,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,911 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:15,911 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:15,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:27:15,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:27:15,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,916 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-09 23:27:15,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,917 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,917 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:15,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,919 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,919 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:15,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,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-09 23:27:15,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,922 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,922 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:15,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,924 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,924 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:15,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,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-09 23:27:15,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,925 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,926 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:15,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,928 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:15,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,931 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,931 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:15,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,935 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,936 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:15,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,938 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-09 23:27:15,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:15,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:15,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,941 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:15,942 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:15,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,945 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,945 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:15,945 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:15,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,946 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:15,947 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:15,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,948 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:15,948 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:15,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,950 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,950 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:15,951 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:15,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,954 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,954 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:15,955 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:15,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,960 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:15,960 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:15,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,963 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-09 23:27:15,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,964 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:15,964 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:15,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,967 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:15,967 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:15,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,970 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,970 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:15,971 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-09 23:27:15,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,972 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:15,972 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:15,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,974 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:15,974 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:15,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,977 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,977 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:15,977 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-09 23:27:15,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,981 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:15,981 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:15,981 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-09 23:27:15,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:27:15,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:15,988 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:15,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,991 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-09 23:27:15,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:15,992 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:15,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,992 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,993 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:15,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:15,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:15,995 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:15,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:15,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:15,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:15,996 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:15,996 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:15,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:15,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:15,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,000 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,000 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,000 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:16,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:16,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,003 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:16,003 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:16,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,004 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:16,005 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:16,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,007 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,008 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:16,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:16,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,013 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,013 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:16,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:16,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,020 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,021 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-09 23:27:16,021 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-09 23:27:16,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,025 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-09 23:27:16,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,025 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:16,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,026 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,026 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,030 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:16,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,030 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,036 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:16,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,037 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,037 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,037 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:16,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,039 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:16,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,042 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:16,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,042 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,042 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,046 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:16,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,046 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,046 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,047 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:16,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,053 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:16,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,054 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,054 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,055 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:16,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,066 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-09 23:27:16,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,072 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-09 23:27:16,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,073 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,073 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,074 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:16,076 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:16,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,080 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,081 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:16,082 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:16,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,087 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,088 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,088 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:16,089 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-09 23:27:16,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,091 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,091 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,091 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:16,092 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:16,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,094 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:16,094 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:16,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,098 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,099 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,099 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:16,100 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-09 23:27:16,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,108 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,109 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,109 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:16,111 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-09 23:27:16,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-09 23:27:16,132 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-09 23:27:16,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,141 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-09 23:27:16,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,142 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,142 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,142 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,143 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,145 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,145 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,146 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,149 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,150 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,150 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,150 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:16,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,152 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,153 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,153 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,155 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,155 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,155 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,158 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,158 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,158 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,158 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:16,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,163 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,163 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,164 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,164 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:27:16,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-09 23:27:16,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,173 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-09 23:27:16,174 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:27:16,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,179 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-09 23:27:16,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,179 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,180 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:16,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:16,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,183 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,183 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:16,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:16,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,191 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,191 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,191 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:16,192 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-09 23:27:16,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,194 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,194 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:16,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:16,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,197 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,198 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:16,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:16,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,201 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,201 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:16,202 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-09 23:27:16,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,210 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,210 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:27:16,210 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:16,211 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-09 23:27:16,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:27:16,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-09 23:27:16,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-09 23:27:16,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:27:16,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:27:16,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:27:16,231 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-09 23:27:16,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:27:16,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:27:16,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:27:16,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:27:16,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:27:16,254 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-09 23:27:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:27:16,711 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-09 23:27:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:27:16,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-09 23:27:16,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-09 23:27:16,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-09 23:27:16,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-09 23:27:16,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-09 23:27:16,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-09 23:27:16,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:27:16,720 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-09 23:27:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-09 23:27:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-09 23:27:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-09 23:27:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-09 23:27:16,738 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-09 23:27:16,738 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-09 23:27:16,738 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 23:27:16,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-09 23:27:16,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-09 23:27:16,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:16,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:16,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 23:27:16,742 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-09 23:27:16,743 INFO L793 eck$LassoCheckResult]: Stem: 1793#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 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-09 23:27:16,744 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1902#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);~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; 2202#L606-3 assume true; 2200#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2198#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; 2196#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); 2194#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2192#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); 2190#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2188#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); 2186#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2184#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)); 2181#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); 2179#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); 2177#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); 2175#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2173#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); 2171#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2169#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2167#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2165#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); 2163#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); 2161#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2159#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); 2157#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2142#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2143#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); 2153#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2151#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); 2150#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); 2149#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2126#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2125#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2123#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2121#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); 2119#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2117#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2115#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2113#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); 2112#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2111#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2109#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); 2110#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2213#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); 2214#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); 1927#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 1836#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); 1837#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 1885#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 1760#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)); 1761#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); 1762#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1779#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-09 23:27:16,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-09 23:27:16,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:16,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:16,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:16,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-09 23:27:16,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:16,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:16,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:16,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:27:16,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:27:16,824 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-09 23:27:16,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:27:16,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-09 23:27:16,825 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:27:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:27:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:27:16,825 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-09 23:27:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:27:17,506 INFO L93 Difference]: Finished difference Result 1228 states and 1697 transitions. [2018-11-09 23:27:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:27:17,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1697 transitions. [2018-11-09 23:27:17,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-09 23:27:17,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1697 transitions. [2018-11-09 23:27:17,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-09 23:27:17,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-09 23:27:17,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1697 transitions. [2018-11-09 23:27:17,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:27:17,524 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1697 transitions. [2018-11-09 23:27:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1697 transitions. [2018-11-09 23:27:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-09 23:27:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-09 23:27:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1691 transitions. [2018-11-09 23:27:17,545 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-09 23:27:17,545 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-09 23:27:17,545 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 23:27:17,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1691 transitions. [2018-11-09 23:27:17,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-09 23:27:17,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:17,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:17,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 23:27:17,555 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-09 23:27:17,555 INFO L793 eck$LassoCheckResult]: Stem: 3692#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-09 23:27:17,555 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4655#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4653#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; 4651#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); 4649#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4647#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); 4645#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4643#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); 4641#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3590#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4755#L606-3 assume true; 4754#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4753#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; 4752#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3671#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4767#L606-3 assume true; 4571#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4570#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; 4568#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); 4566#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4564#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); 4562#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4560#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); 4558#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4556#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)); 4554#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); 4552#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); 4550#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); 4548#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4546#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); 4544#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4542#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4529#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4524#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); 4517#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); 4516#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4495#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); 4492#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4207#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4208#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); 4489#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4483#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); 4424#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); 4177#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 3670#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 3589#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 3591#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4679#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); 4675#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4537#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4535#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4532#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); 4530#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4525#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4519#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); 4520#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4575#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); 4573#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); 4423#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4422#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); 4421#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4420#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4418#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)); 4416#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); 4414#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; 4073#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-09 23:27:17,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-09 23:27:17,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:17,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-09 23:27:17,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:17,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:17,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:27:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:27:17,641 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-09 23:27:17,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:27:17,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:27:17,641 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:27:17,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:27:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:27:17,642 INFO L87 Difference]: Start difference. First operand 1225 states and 1691 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-09 23:27:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:27:17,988 INFO L93 Difference]: Finished difference Result 1509 states and 2000 transitions. [2018-11-09 23:27:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:27:17,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2000 transitions. [2018-11-09 23:27:17,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-09 23:27:17,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2000 transitions. [2018-11-09 23:27:18,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-09 23:27:18,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-09 23:27:18,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2000 transitions. [2018-11-09 23:27:18,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:27:18,003 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2000 transitions. [2018-11-09 23:27:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2000 transitions. [2018-11-09 23:27:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-09 23:27:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-09 23:27:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1998 transitions. [2018-11-09 23:27:18,022 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-09 23:27:18,022 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-09 23:27:18,022 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 23:27:18,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 1998 transitions. [2018-11-09 23:27:18,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-09 23:27:18,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:18,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:18,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 23:27:18,029 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-09 23:27:18,029 INFO L793 eck$LassoCheckResult]: Stem: 6436#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-09 23:27:18,029 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7184#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7175#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; 7174#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); 7172#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7170#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); 7168#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7166#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); 7164#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7162#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)); 7160#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); 7158#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); 7156#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); 7154#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7152#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); 7150#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7148#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7146#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7144#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; 6458#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6566#L606-3 assume true; 6559#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6414#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; 6415#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; 6774#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7455#L606-3 assume true; 7453#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7451#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; 7449#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); 7447#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7445#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); 7443#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7441#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); 7439#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7437#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)); 7435#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); 7433#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); 7431#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); 7429#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7427#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); 7425#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7423#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7421#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7419#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); 7417#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); 7415#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7412#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); 7413#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7617#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7615#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); 7613#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7611#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); 7609#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); 7605#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7603#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7353#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7182#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7183#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); 7358#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7360#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7378#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7379#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); 7355#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6417#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6418#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); 6593#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6397#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); 6398#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); 7321#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7319#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); 7317#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7315#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7313#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)); 7311#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); 7188#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; 7186#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-09 23:27:18,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-09 23:27:18,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:18,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:18,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-09 23:27:18,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:18,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:27:18,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:27:18,074 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-09 23:27:18,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:27:18,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:27:18,075 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:27:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:27:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:27:18,075 INFO L87 Difference]: Start difference. First operand 1508 states and 1998 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-09 23:27:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:27:18,499 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-09 23:27:18,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:27:18,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-09 23:27:18,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-09 23:27:18,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-09 23:27:18,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-09 23:27:18,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-09 23:27:18,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-09 23:27:18,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:27:18,514 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-09 23:27:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-09 23:27:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-09 23:27:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-09 23:27:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-09 23:27:18,532 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-09 23:27:18,532 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-09 23:27:18,532 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-09 23:27:18,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-09 23:27:18,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-09 23:27:18,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:18,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:18,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 23:27:18,537 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-09 23:27:18,537 INFO L793 eck$LassoCheckResult]: Stem: 9454#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-09 23:27:18,537 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10672#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10671#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; 10670#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); 10237#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10238#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); 10286#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10285#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); 10279#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10280#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)); 10273#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); 10274#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); 10345#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); 10342#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10341#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); 10340#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10339#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10337#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 10329#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); 10330#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); 10627#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10626#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); 10625#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10590#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10585#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); 10579#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10573#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); 10567#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); 10559#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9787#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; 9680#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9782#L606-3 assume true; 9780#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9778#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; 9776#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); 9774#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9772#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); 9770#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9768#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); 9766#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9764#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)); 9762#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); 9760#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); 9758#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); 9756#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9754#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); 9752#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9750#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9748#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9746#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); 9744#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); 9742#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9740#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); 9738#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9736#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9734#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); 9732#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9730#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); 9728#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); 9725#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9723#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9721#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9719#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9717#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); 9715#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9713#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9711#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9709#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); 9707#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9705#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9703#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); 9701#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9699#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); 9697#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); 9695#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9693#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); 9691#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9689#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9687#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)); 9685#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); 9682#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; 9683#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-09 23:27:18,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-09 23:27:18,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:18,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:18,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:18,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:18,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-09 23:27:18,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:18,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:18,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:27:18,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:27:18,589 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-09 23:27:18,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:27:18,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 23:27:18,589 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 23:27:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 23:27:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 23:27:18,590 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-09 23:27:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:27:18,799 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-09 23:27:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 23:27:18,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-09 23:27:18,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-09 23:27:18,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-09 23:27:18,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-09 23:27:18,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-09 23:27:18,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-09 23:27:18,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:27:18,809 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-09 23:27:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-09 23:27:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-09 23:27:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-09 23:27:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-09 23:27:18,820 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-09 23:27:18,821 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-09 23:27:18,821 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-09 23:27:18,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-09 23:27:18,824 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-09 23:27:18,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:18,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:18,825 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 23:27:18,825 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-09 23:27:18,825 INFO L793 eck$LassoCheckResult]: Stem: 12456#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-09 23:27:18,826 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13352#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13351#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; 13349#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); 13348#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13347#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); 13346#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13344#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); 13342#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13335#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)); 13334#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); 13332#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); 13330#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); 13328#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13326#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); 13324#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13322#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13320#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13318#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); 13316#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); 13314#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13312#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); 13310#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13308#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13306#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); 13304#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13302#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); 13300#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); 13298#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 13296#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 13294#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13292#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13290#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); 13288#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13286#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13284#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13282#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); 13280#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13278#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13276#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); 13274#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13272#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); 13270#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); 13268#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13266#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); 13264#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13262#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13260#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)); 13258#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); 13256#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); 13254#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13252#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); 13250#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13248#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13246#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); 13244#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); 13242#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13240#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13238#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); 13236#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13234#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); 13232#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); 13230#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13228#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)); 13226#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13224#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); 13222#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13220#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)); 13218#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13216#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13214#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13212#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)); 13210#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13208#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)); 13206#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13204#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13202#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13200#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); 13198#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13196#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13194#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13192#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13190#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13188#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13186#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13184#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13182#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); 13179#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13177#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13175#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13173#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13171#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13169#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13167#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13165#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13163#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13160#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13158#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13156#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13154#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13152#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13150#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13148#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13145#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13143#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13142#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13141#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13139#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13137#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13135#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13134#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13132#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12488#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13407#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13405#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13403#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13401#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13399#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13397#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13395#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13393#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13391#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13389#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13387#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13385#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13383#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13381#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13379#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13377#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13375#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13373#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13371#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13369#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13367#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13365#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13363#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13361#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13359#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13357#L594-1 calculate_output_#res := -2; 13355#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-09 23:27:18,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-09 23:27:18,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:18,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:18,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-09 23:27:18,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:18,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:18,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:18,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:18,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-09 23:27:18,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:18,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:27:19,255 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-09 23:27:19,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:27:19,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-09 23:27:19,898 WARN L179 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-09 23:27:19,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-09 23:27:19,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-09 23:27:19,966 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-09 23:27:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:27:20,698 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-09 23:27:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-09 23:27:20,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-09 23:27:20,703 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-09 23:27:20,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-09 23:27:20,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-09 23:27:20,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-09 23:27:20,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-09 23:27:20,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:27:20,713 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-09 23:27:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-09 23:27:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-09 23:27:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-09 23:27:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-09 23:27:20,734 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-09 23:27:20,734 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-09 23:27:20,734 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-09 23:27:20,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-09 23:27:20,739 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-09 23:27:20,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:27:20,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:27:20,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:27:20,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:27:20,740 INFO L793 eck$LassoCheckResult]: Stem: 15664#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; 16900#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16897#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; 16894#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); 16296#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; 15807#L597 [2018-11-09 23:27:20,740 INFO L795 eck$LassoCheckResult]: Loop: 15807#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16272#L606-3 assume true; 16270#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16268#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; 16266#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); 16264#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16262#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); 16260#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16258#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; 15807#L597 [2018-11-09 23:27:20,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-09 23:27:20,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:20,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:20,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:20,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:20,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-09 23:27:20,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:20,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:20,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:20,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:20,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:20,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:27:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-09 23:27:20,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:27:20,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:27:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:20,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:27:20,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:27:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:27:20,953 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:27:20,953 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:27:20,953 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:27:20,953 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:27:20,953 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 23:27:20,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:27:20,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:27:20,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:27:20,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-09 23:27:20,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:27:20,954 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:27:20,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:20,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:20,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:20,964 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-09 23:27:20,966 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-09 23:27:20,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:20,970 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-09 23:27:20,973 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-09 23:27:20,975 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-09 23:27:20,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:20,979 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-09 23:27:20,981 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-09 23:27:20,983 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-09 23:27:20,985 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-09 23:27:20,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-09 23:27:20,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 23:27:21,000 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-09 23:27:21,006 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-09 23:27:21,012 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-09 23:27:21,015 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-09 23:27:21,017 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-09 23:27:21,138 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:27:21,138 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,146 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,147 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,180 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,180 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,187 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,187 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,204 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,206 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,206 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,224 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,224 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,257 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,257 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,261 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,263 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,264 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,295 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,295 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,320 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,320 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,325 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,326 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,357 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,357 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,361 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,376 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,376 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,383 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,383 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,400 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,402 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,403 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,434 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,434 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,438 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:27:21,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,651 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,651 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,670 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,670 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,686 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,704 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 23:27:21,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,853 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,853 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,869 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,887 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,887 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,892 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,892 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_86be3f58-1cd1-4bee-a549-303e58476124/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-09 23:27:21,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 23:27:21,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 23:27:21,914 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 23:27:21,915 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-09 23:27:21,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 11:27:21 BoogieIcfgContainer [2018-11-09 23:27:21,952 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 23:27:21,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:27:21,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:27:21,953 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:27:21,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:27:12" (3/4) ... [2018-11-09 23:27:21,956 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-09 23:27:21,993 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_86be3f58-1cd1-4bee-a549-303e58476124/bin-2019/uautomizer/witness.graphml [2018-11-09 23:27:21,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:27:21,994 INFO L168 Benchmark]: Toolchain (without parser) took 10541.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 478.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -101.8 MB). Peak memory consumption was 376.9 MB. Max. memory is 11.5 GB. [2018-11-09 23:27:21,995 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:27:21,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.53 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 917.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-09 23:27:21,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 917.3 MB in the beginning and 1.1 GB in the end (delta: -219.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-09 23:27:21,996 INFO L168 Benchmark]: Boogie Preprocessor took 39.00 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-09 23:27:21,996 INFO L168 Benchmark]: RCFGBuilder took 758.64 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: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. [2018-11-09 23:27:21,998 INFO L168 Benchmark]: BuchiAutomizer took 9252.96 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -38.5 MB). Peak memory consumption was 534.3 MB. Max. memory is 11.5 GB. [2018-11-09 23:27:21,999 INFO L168 Benchmark]: Witness Printer took 40.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-09 23:27:22,001 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.53 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 917.3 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 106.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 917.3 MB in the beginning and 1.1 GB in the end (delta: -219.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.00 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 758.64 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: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9252.96 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -38.5 MB). Peak memory consumption was 534.3 MB. Max. memory is 11.5 GB. * Witness Printer took 40.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.5s. 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, 3081 SDslu, 490 SDs, 0 SdLazy, 3703 SolverSat, 847 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: 62ms 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@5a15d427=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b324a87=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@5a15d427=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b324a87=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@5a15d427=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@3b324a87=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...