./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label02_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label02_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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 79f8d22fb07c95427dd318f6d0f74f02d2c9197f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 11:57:31,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:57:31,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:57:31,800 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:57:31,800 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:57:31,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:57:31,801 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:57:31,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:57:31,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:57:31,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:57:31,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:57:31,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:57:31,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:57:31,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:57:31,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:57:31,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:57:31,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:57:31,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:57:31,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:57:31,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:57:31,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:57:31,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:57:31,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:57:31,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:57:31,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:57:31,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:57:31,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:57:31,818 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:57:31,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:57:31,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:57:31,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:57:31,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:57:31,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:57:31,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:57:31,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:57:31,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:57:31,821 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:57:31,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:57:31,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:57:31,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:57:31,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:57:31,833 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:57:31,834 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:57:31,834 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:57:31,834 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:57:31,834 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:57:31,834 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:57:31,834 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:57:31,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:57:31,835 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:57:31,835 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:57:31,835 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:57:31,835 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:57:31,835 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:57:31,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:57:31,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:57:31,836 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:57:31,836 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:57:31,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:57:31,836 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:57:31,836 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:57:31,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:57:31,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:57:31,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:57:31,837 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:57:31,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:57:31,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:57:31,837 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:57:31,838 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:57:31,838 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_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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 -> 79f8d22fb07c95427dd318f6d0f74f02d2c9197f [2018-11-28 11:57:31,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:57:31,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:57:31,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:57:31,876 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:57:31,876 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:57:31,877 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label02_true-unreach-call_false-termination.c [2018-11-28 11:57:31,923 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/data/11f5361b4/23d3e14f8cdd4309b2e3ae7219682494/FLAGcf00eac60 [2018-11-28 11:57:32,376 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:57:32,377 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/sv-benchmarks/c/eca-rers2012/Problem02_label02_true-unreach-call_false-termination.c [2018-11-28 11:57:32,388 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/data/11f5361b4/23d3e14f8cdd4309b2e3ae7219682494/FLAGcf00eac60 [2018-11-28 11:57:32,894 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/data/11f5361b4/23d3e14f8cdd4309b2e3ae7219682494 [2018-11-28 11:57:32,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:57:32,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:57:32,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:57:32,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:57:32,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:57:32,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:57:32" (1/1) ... [2018-11-28 11:57:32,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e63e29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:32, skipping insertion in model container [2018-11-28 11:57:32,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:57:32" (1/1) ... [2018-11-28 11:57:32,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:57:32,937 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:57:33,173 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:57:33,178 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:57:33,310 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:57:33,323 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:57:33,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33 WrapperNode [2018-11-28 11:57:33,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:57:33,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:57:33,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:57:33,324 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:57:33,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:57:33,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:57:33,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:57:33,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:57:33,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... [2018-11-28 11:57:33,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:57:33,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:57:33,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:57:33,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:57:33,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:57:33,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:57:34,252 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:57:34,252 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 11:57:34,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:57:34 BoogieIcfgContainer [2018-11-28 11:57:34,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:57:34,253 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:57:34,253 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:57:34,257 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:57:34,258 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:57:34,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:57:32" (1/3) ... [2018-11-28 11:57:34,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34bd619b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:57:34, skipping insertion in model container [2018-11-28 11:57:34,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:57:34,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:57:33" (2/3) ... [2018-11-28 11:57:34,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34bd619b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:57:34, skipping insertion in model container [2018-11-28 11:57:34,260 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:57:34,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:57:34" (3/3) ... [2018-11-28 11:57:34,261 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label02_true-unreach-call_false-termination.c [2018-11-28 11:57:34,304 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:57:34,305 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:57:34,305 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:57:34,305 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:57:34,305 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:57:34,305 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:57:34,306 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:57:34,306 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:57:34,306 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:57:34,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 11:57:34,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 11:57:34,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:34,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:34,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:57:34,357 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:57:34,357 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:57:34,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 11:57:34,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 11:57:34,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:34,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:34,363 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:57:34,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:57:34,371 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-11-28 11:57:34,371 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-11-28 11:57:34,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:57:34,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:34,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:34,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:34,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:34,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-28 11:57:34,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:34,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:34,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:34,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-28 11:57:34,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:34,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:34,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:34,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:34,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:34,562 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-28 11:57:34,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:57:34,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:57:34,693 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-28 11:57:34,746 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:57:34,747 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:57:34,747 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:57:34,747 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:57:34,747 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:57:34,748 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:57:34,748 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:57:34,748 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:57:34,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label02_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 11:57:34,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:57:34,748 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:57:34,769 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-28 11:57:34,775 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-28 11:57:34,813 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-28 11:57:34,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-28 11:57:34,820 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-28 11:57:34,822 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-28 11:57:34,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-28 11:57:34,829 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-28 11:57:34,991 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:57:34,991 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:34,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:34,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:35,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:35,000 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:35,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:35,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:35,028 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:35,029 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:35,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:35,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:35,048 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:35,048 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:35,073 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:35,073 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:35,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:35,076 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:35,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:35,105 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:35,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:35,108 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:35,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:35,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:35,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:35,128 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:35,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:35,153 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:35,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:35,165 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:35,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:35,181 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:35,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:57:35,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:35,221 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:57:35,223 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:57:35,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:57:35,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:57:35,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:57:35,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:57:35,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:57:35,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:57:35,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:57:35,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label02_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 11:57:35,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:57:35,224 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:57:35,226 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-28 11:57:35,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-28 11:57:35,239 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-28 11:57:35,258 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-28 11:57:35,273 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-28 11:57:35,280 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-28 11:57:35,282 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-28 11:57:35,285 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-28 11:57:35,427 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:57:35,431 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:57:35,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:35,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:35,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:35,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:35,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,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-28 11:57:35,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,451 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:35,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:35,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:35,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:35,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:35,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:35,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:35,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:35,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:35,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:35,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,519 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:35,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:35,524 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,528 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:57:35,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,529 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,530 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,538 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,539 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,543 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,543 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,547 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 11:57:35,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,563 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,563 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,568 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,571 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,576 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,576 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,580 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,585 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:35,585 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:35,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,592 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:57:35,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,594 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,603 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,603 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,608 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,609 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:57:35,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,621 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,627 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,627 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,629 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,630 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,632 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,633 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,634 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:35,634 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,635 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:35,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,639 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:57:35,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,643 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,644 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,651 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,651 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,654 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,655 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 11:57:35,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,666 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,667 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,671 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,671 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,674 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,674 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,677 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,677 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:35,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,679 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:35,679 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,680 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:57:35,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,683 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:57:35,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,684 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,685 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,685 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,697 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,697 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,698 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,701 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,701 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,701 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,703 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 11:57:35,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,725 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,725 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,726 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,730 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,731 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,734 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,734 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,735 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,737 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,738 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:35,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,740 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,740 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:35,740 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:35,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:35,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,747 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:57:35,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,748 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:35,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,748 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,749 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,759 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:35,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,759 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,760 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,764 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:35,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,764 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,767 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:57:35,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,786 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,787 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:35,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,787 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,788 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,792 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,792 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:35,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,793 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,796 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:35,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,801 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:35,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,802 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,804 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:35,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,804 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:35,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,805 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:35,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,811 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:57:35,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,813 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,815 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,821 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,823 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,826 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,827 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,827 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,830 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 11:57:35,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,857 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,857 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,858 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,865 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,865 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,866 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,870 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,870 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,871 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,875 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,875 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,876 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:35,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,877 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,878 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:35,878 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:35,879 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:57:35,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,886 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:57:35,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,887 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,887 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,896 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,896 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,900 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,900 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,901 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:57:35,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,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-28 11:57:35,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,914 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,915 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,919 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,924 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,927 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,927 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,929 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,929 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,930 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,930 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:35,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,932 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:35,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,932 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:35,932 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:35,933 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:35,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,938 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:57:35,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-28 11:57:35,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,939 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:35,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:35,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:35,962 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:35,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:35,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:35,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:35,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:35,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:35,965 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:35,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:35,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:35,966 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:57:35,966 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:35,968 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-28 11:57:35,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:36,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:36,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:36,016 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:36,016 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:36,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:36,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:36,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:36,017 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:36,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:36,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:36,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:36,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:36,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:36,024 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:36,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:36,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:36,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:36,025 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:36,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:36,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:36,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:36,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:36,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:36,028 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:36,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:36,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:36,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:36,029 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:36,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:36,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:36,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:36,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-28 11:57:36,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:36,032 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:36,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:36,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:36,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:36,032 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:36,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:36,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:36,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:36,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:36,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:36,035 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:36,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:36,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:36,035 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:36,035 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:36,036 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:57:36,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:36,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:57:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:57:36,057 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-28 11:57:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:57:36,601 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-11-28 11:57:36,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:57:36,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-11-28 11:57:36,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 11:57:36,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-11-28 11:57:36,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-11-28 11:57:36,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-11-28 11:57:36,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-11-28 11:57:36,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:57:36,618 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-11-28 11:57:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-11-28 11:57:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-11-28 11:57:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-28 11:57:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-11-28 11:57:36,643 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 11:57:36,643 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 11:57:36,643 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:57:36,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-11-28 11:57:36,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-11-28 11:57:36,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:36,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:36,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:57:36,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:57:36,645 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-11-28 11:57:36,646 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-11-28 11:57:36,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:36,646 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 11:57:36,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:36,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:36,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:36,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-28 11:57:36,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:36,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:36,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:57:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:36,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:36,661 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-28 11:57:36,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:36,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:36,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:36,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:36,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:36,685 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-28 11:57:36,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:57:36,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:57:36,783 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:57:36,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:57:36,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:57:36,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:57:36,784 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:57:36,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:57:36,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:57:36,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:57:36,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label02_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 11:57:36,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:57:36,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:57:36,786 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-28 11:57:36,791 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-28 11:57:36,795 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-28 11:57:36,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-28 11:57:36,800 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-28 11:57:36,803 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-28 11:57:36,808 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-28 11:57:36,817 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-28 11:57:36,934 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:57:36,934 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:36,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:36,938 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:36,941 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:36,941 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:36,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:36,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:36,970 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:36,970 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:36,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:36,996 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:36,999 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:36,999 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:37,015 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:37,015 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:37,017 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:37,017 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:37,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:37,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:37,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:37,035 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:37,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:37,058 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:37,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:57:37,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:37,100 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:57:37,101 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:57:37,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:57:37,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:57:37,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:57:37,102 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:57:37,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:57:37,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:57:37,102 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:57:37,102 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label02_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 11:57:37,102 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:57:37,102 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:57:37,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:37,128 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-28 11:57:37,131 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-28 11:57:37,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:37,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:37,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:37,170 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-28 11:57:37,175 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-28 11:57:37,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:57:37,330 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:57:37,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:37,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:37,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,333 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:37,334 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:37,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:37,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,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-28 11:57:37,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:37,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:37,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,338 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:37,339 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,341 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:37,341 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,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-28 11:57:37,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:37,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:37,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:57:37,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:57:37,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,349 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:57:37,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,350 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,350 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,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-28 11:57:37,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,353 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,353 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,354 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,354 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,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-28 11:57:37,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,359 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,361 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,361 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,364 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,364 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,369 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,369 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,372 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,373 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,374 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:57:37,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-28 11:57:37,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,375 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,375 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,377 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,377 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,378 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,379 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,379 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,381 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,382 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,383 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,384 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,386 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,386 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,387 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,394 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,395 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,398 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,409 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:57:37,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,410 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,410 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,414 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,414 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,414 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:57:37,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,416 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,416 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,418 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,418 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,421 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,421 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:57:37,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,426 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,426 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,426 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:57:37,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,431 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,432 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:57:37,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,435 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,435 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,438 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:57:37,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,439 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,439 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,439 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,442 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,442 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,442 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,442 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,445 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,446 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,446 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,447 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,447 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,448 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,448 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,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-28 11:57:37,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,450 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,450 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,450 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,455 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,455 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,455 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,455 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,470 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,470 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,471 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,477 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,478 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:57:37,478 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:57:37,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,480 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:57:37,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,481 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:37,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,482 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,482 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,485 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:37,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,486 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,486 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,486 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,489 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:37,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,489 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,490 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,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-28 11:57:37,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,491 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:37,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,491 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,492 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,495 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:37,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,495 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,495 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,497 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,502 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:37,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,502 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,502 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,503 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,516 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:37,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,517 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,522 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:57:37,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,523 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,523 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,527 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:57:37,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-28 11:57:37,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,527 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,528 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,536 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,541 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,541 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,541 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,542 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:57:37,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,544 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,544 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,544 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,545 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,546 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,546 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,547 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,547 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,552 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,552 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,552 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,552 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,553 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:57:37,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,561 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,562 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,564 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:57:37,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,579 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,579 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,581 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,588 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,589 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:57:37,590 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:57:37,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,595 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:57:37,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,595 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,596 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,596 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,598 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,598 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,599 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,601 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,601 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,601 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,601 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,603 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,603 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,604 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,606 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,606 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,607 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,611 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,612 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,612 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,613 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:57:37,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,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-28 11:57:37,619 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,619 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,619 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,620 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:57:37,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,627 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:57:37,627 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:57:37,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,630 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:57:37,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,631 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,632 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:37,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,635 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,635 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,635 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:37,636 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:57:37,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,638 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,638 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:37,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,641 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,641 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:37,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,644 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,645 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,645 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:37,646 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:57:37,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,656 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,656 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:57:37,656 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:37,658 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:57:37,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,672 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,673 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:37,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:57:37,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:57:37,688 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:57:37,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:57:37,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:57:37,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:57:37,688 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:57:37,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:57:37,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:57:37,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:57:37,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:57:37,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:57:37,694 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-11-28 11:57:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:57:38,013 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-11-28 11:57:38,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:57:38,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-11-28 11:57:38,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 11:57:38,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 11:57:38,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-11-28 11:57:38,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-11-28 11:57:38,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-11-28 11:57:38,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:57:38,026 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 11:57:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-11-28 11:57:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-11-28 11:57:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-28 11:57:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 11:57:38,044 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 11:57:38,044 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 11:57:38,044 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:57:38,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-11-28 11:57:38,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 11:57:38,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:38,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:38,049 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:57:38,049 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:57:38,049 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-11-28 11:57:38,050 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-11-28 11:57:38,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 11:57:38,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:38,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:38,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-28 11:57:38,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:38,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:38,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:38,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:57:38,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:57:38,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:57:38,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:57:38,138 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:57:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:57:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:57:38,138 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-11-28 11:57:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:57:38,621 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-11-28 11:57:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:57:38,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-11-28 11:57:38,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-11-28 11:57:38,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-11-28 11:57:38,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-11-28 11:57:38,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-11-28 11:57:38,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-11-28 11:57:38,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:57:38,636 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-11-28 11:57:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-11-28 11:57:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-11-28 11:57:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-11-28 11:57:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-11-28 11:57:38,656 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 11:57:38,656 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 11:57:38,656 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:57:38,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-11-28 11:57:38,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-11-28 11:57:38,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:38,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:38,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:57:38,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:57:38,663 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-11-28 11:57:38,664 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-11-28 11:57:38,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:38,664 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-28 11:57:38,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:38,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:38,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:38,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:38,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:38,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-28 11:57:38,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:38,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:38,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:38,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:57:38,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:57:38,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:57:38,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:57:38,708 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:57:38,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:57:38,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:57:38,709 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-11-28 11:57:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:57:39,016 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-11-28 11:57:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:57:39,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-11-28 11:57:39,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 11:57:39,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 11:57:39,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-11-28 11:57:39,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-11-28 11:57:39,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-11-28 11:57:39,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:57:39,030 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 11:57:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-11-28 11:57:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-11-28 11:57:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-11-28 11:57:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 11:57:39,047 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 11:57:39,047 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 11:57:39,047 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:57:39,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-11-28 11:57:39,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 11:57:39,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:39,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:39,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:57:39,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:57:39,054 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-11-28 11:57:39,054 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-11-28 11:57:39,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-28 11:57:39,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:39,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:39,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:39,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:39,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:39,059 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-28 11:57:39,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:39,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:39,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:57:39,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:57:39,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:57:39,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:57:39,104 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:57:39,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:57:39,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:57:39,104 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-11-28 11:57:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:57:39,394 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-11-28 11:57:39,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:57:39,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-11-28 11:57:39,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 11:57:39,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 11:57:39,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-11-28 11:57:39,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-11-28 11:57:39,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-11-28 11:57:39,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:57:39,404 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 11:57:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-11-28 11:57:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-11-28 11:57:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-11-28 11:57:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 11:57:39,415 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 11:57:39,415 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 11:57:39,415 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:57:39,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-11-28 11:57:39,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 11:57:39,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:39,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:39,420 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:57:39,420 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:57:39,421 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-11-28 11:57:39,421 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-11-28 11:57:39,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-28 11:57:39,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:39,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-28 11:57:39,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:39,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:57:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:57:39,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:57:39,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:57:39,482 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:57:39,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:57:39,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:57:39,482 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-11-28 11:57:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:57:39,639 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-11-28 11:57:39,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:57:39,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-11-28 11:57:39,644 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 11:57:39,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 11:57:39,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-11-28 11:57:39,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-11-28 11:57:39,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-11-28 11:57:39,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:57:39,650 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 11:57:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-11-28 11:57:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-11-28 11:57:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-11-28 11:57:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 11:57:39,663 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 11:57:39,663 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 11:57:39,663 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:57:39,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-11-28 11:57:39,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 11:57:39,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:39,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:39,669 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:57:39,669 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:57:39,669 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-11-28 11:57:39,672 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-11-28 11:57:39,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-28 11:57:39,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:39,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:39,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-28 11:57:39,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:39,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:39,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:39,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:39,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-28 11:57:39,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:39,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:39,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:40,038 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-28 11:57:40,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:57:40,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:57:40,725 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-28 11:57:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:57:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:57:40,802 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-11-28 11:57:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:57:41,299 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-11-28 11:57:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:57:41,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-11-28 11:57:41,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 11:57:41,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-11-28 11:57:41,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-11-28 11:57:41,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-11-28 11:57:41,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-11-28 11:57:41,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:57:41,312 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 11:57:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-11-28 11:57:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-11-28 11:57:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-11-28 11:57:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-11-28 11:57:41,327 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 11:57:41,327 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 11:57:41,327 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:57:41,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-11-28 11:57:41,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 11:57:41,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:57:41,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:57:41,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:57:41,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:57:41,332 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2018-11-28 11:57:41,332 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2018-11-28 11:57:41,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-28 11:57:41,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:41,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:41,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-28 11:57:41,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:41,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:41,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:41,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:57:41,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-28 11:57:41,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:57:41,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:57:41,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:41,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:41,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:57:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:57:41,573 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:57:41,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:57:41,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:57:41,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:57:41,573 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:57:41,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:57:41,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:57:41,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:57:41,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label02_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-28 11:57:41,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:57:41,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:57:41,576 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-28 11:57:41,583 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-28 11:57:41,585 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-28 11:57:41,587 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-28 11:57:41,588 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-28 11:57:41,590 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-28 11:57:41,594 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-28 11:57:41,598 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-28 11:57:41,599 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-28 11:57:41,602 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-28 11:57:41,603 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-28 11:57:41,606 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-28 11:57:41,608 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-28 11:57:41,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:41,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:41,623 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-28 11:57:41,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:41,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:41,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:41,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:57:41,645 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-28 11:57:41,777 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:57:41,777 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,783 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,783 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,801 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,801 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,818 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,818 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,836 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,854 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,854 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,870 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,872 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,872 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,888 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,890 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,890 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,908 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,908 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,925 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,925 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,942 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,943 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,968 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,968 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,972 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:41,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:41,988 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:41,990 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:41,990 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,005 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,008 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,008 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,024 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,025 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,026 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,040 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,042 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,043 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,058 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:57:42,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,237 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,238 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,255 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,257 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,272 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,272 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,274 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,274 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,290 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,308 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:57:42,308 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,446 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,446 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/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-28 11:57:42,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:57:42,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:57:42,482 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:57:42,482 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-28 11:57:42,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:57:42 BoogieIcfgContainer [2018-11-28 11:57:42,518 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:57:42,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:57:42,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:57:42,519 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:57:42,519 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:57:34" (3/4) ... [2018-11-28 11:57:42,522 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 11:57:42,559 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ad4fad6-4dc1-4ded-a9ac-4408f79f3388/bin-2019/uautomizer/witness.graphml [2018-11-28 11:57:42,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:57:42,560 INFO L168 Benchmark]: Toolchain (without parser) took 9663.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 494.4 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -396.6 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:57:42,560 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:57:42,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:57:42,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.23 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:57:42,561 INFO L168 Benchmark]: Boogie Preprocessor took 43.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:57:42,561 INFO L168 Benchmark]: RCFGBuilder took 839.33 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: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:57:42,562 INFO L168 Benchmark]: BuchiAutomizer took 8265.25 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 352.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -355.8 MB). Peak memory consumption was 533.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:57:42,562 INFO L168 Benchmark]: Witness Printer took 40.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:57:42,564 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 426.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.23 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 839.33 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: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8265.25 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 352.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -355.8 MB). Peak memory consumption was 533.2 MB. Max. memory is 11.5 GB. * Witness Printer took 40.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 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 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. Construction of modules took 1.8s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s 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: 50ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - 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@43fa73d=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cc42c95=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@43fa73d=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cc42c95=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@43fa73d=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@4cc42c95=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...