./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/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 bf623cbfa27d5f25c20ae418fc6508fd949965cd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:10:27,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:10:27,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:10:27,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:10:27,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:10:27,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:10:27,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:10:27,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:10:27,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:10:27,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:10:27,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:10:27,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:10:27,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:10:27,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:10:27,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:10:27,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:10:27,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:10:27,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:10:27,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:10:27,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:10:27,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:10:27,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:10:27,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:10:27,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:10:27,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:10:27,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:10:27,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:10:27,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:10:27,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:10:27,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:10:27,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:10:27,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:10:27,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:10:27,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:10:27,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:10:27,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:10:27,937 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-03 01:10:27,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:10:27,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:10:27,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:10:27,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:10:27,946 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 01:10:27,946 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-03 01:10:27,946 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-03 01:10:27,946 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-03 01:10:27,946 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-03 01:10:27,946 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-03 01:10:27,946 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-03 01:10:27,946 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:10:27,947 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:10:27,948 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-03 01:10:27,948 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 01:10:27,948 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-03 01:10:27,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:10:27,948 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:10:27,948 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-03 01:10:27,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:10:27,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-03 01:10:27,949 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-03 01:10:27,949 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-03 01:10:27,949 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_93538967-92ba-4e64-897d-1e03b63c1811/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 -> bf623cbfa27d5f25c20ae418fc6508fd949965cd [2018-12-03 01:10:27,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:10:27,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:10:27,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:10:27,980 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:10:27,980 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:10:27,980 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-12-03 01:10:28,021 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/data/34866521e/283ed80fbdb044808504c70b686dabc9/FLAG3cabba108 [2018-12-03 01:10:28,512 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:10:28,512 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/sv-benchmarks/c/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-12-03 01:10:28,519 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/data/34866521e/283ed80fbdb044808504c70b686dabc9/FLAG3cabba108 [2018-12-03 01:10:28,528 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/data/34866521e/283ed80fbdb044808504c70b686dabc9 [2018-12-03 01:10:28,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:10:28,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:10:28,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:10:28,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:10:28,534 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:10:28,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28, skipping insertion in model container [2018-12-03 01:10:28,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:10:28,564 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:10:28,739 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:10:28,742 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:10:28,826 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:10:28,835 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:10:28,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28 WrapperNode [2018-12-03 01:10:28,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:10:28,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:10:28,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:10:28,836 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:10:28,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:10:28,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:10:28,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:10:28,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:10:28,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... [2018-12-03 01:10:28,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:10:28,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:10:28,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:10:28,904 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:10:28,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:10:28,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:10:29,488 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:10:29,488 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-03 01:10:29,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:29 BoogieIcfgContainer [2018-12-03 01:10:29,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:10:29,489 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-03 01:10:29,489 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-03 01:10:29,491 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-03 01:10:29,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 01:10:29,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 03.12 01:10:28" (1/3) ... [2018-12-03 01:10:29,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cb2f447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 03.12 01:10:29, skipping insertion in model container [2018-12-03 01:10:29,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 01:10:29,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:10:28" (2/3) ... [2018-12-03 01:10:29,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cb2f447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 03.12 01:10:29, skipping insertion in model container [2018-12-03 01:10:29,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-03 01:10:29,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:29" (3/3) ... [2018-12-03 01:10:29,494 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label14_true-unreach-call_false-termination.c [2018-12-03 01:10:29,527 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 01:10:29,527 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-03 01:10:29,528 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-03 01:10:29,528 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-03 01:10:29,528 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:10:29,528 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:10:29,528 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-03 01:10:29,528 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:10:29,528 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-03 01:10:29,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-03 01:10:29,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-03 01:10:29,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:29,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:29,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 01:10:29,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:10:29,577 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-03 01:10:29,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-03 01:10:29,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-03 01:10:29,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:29,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:29,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 01:10:29,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-03 01:10:29,587 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-12-03 01:10:29,587 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-12-03 01:10:29,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-03 01:10:29,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:29,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:29,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:29,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:29,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-12-03 01:10:29,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:29,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:29,674 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-12-03 01:10:29,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:29,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:29,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:29,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:29,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:29,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:29,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 01:10:29,815 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:10:29,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:10:29,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:10:29,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:10:29,817 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-03 01:10:29,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:29,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:10:29,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:10:29,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label14_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-03 01:10:29,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:10:29,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:10:29,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:29,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:29,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:29,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:29,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:29,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:29,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:29,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,062 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:10:30,062 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:30,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:30,072 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:30,072 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:30,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:30,099 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:30,099 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:30,115 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:30,118 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:30,119 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:30,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:30,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:30,145 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:30,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:30,163 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:30,163 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:30,178 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:30,180 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:30,180 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:30,205 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:30,209 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:30,209 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:30,224 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-03 01:10:30,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:30,263 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-03 01:10:30,264 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:10:30,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:10:30,265 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:10:30,265 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:10:30,265 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 01:10:30,265 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:30,265 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:10:30,265 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:10:30,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label14_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-03 01:10:30,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:10:30,265 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:10:30,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:30,428 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:10:30,431 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 01:10:30,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-12-03 01:10:30,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:30,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:30,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:30,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:30,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,447 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:30,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:30,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:30,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:30,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:30,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:30,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:30,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:30,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:30,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:30,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,475 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:30,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:30,475 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,479 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-03 01:10:30,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,480 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,481 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,488 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,488 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,492 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,492 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,493 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-03 01:10:30,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,506 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,507 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,511 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,511 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,514 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,515 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,517 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,518 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,519 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:30,519 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:30,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,523 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-03 01:10:30,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,525 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,531 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,532 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,535 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,535 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,536 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-03 01:10:30,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,569 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,575 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,575 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,579 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,579 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,583 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,583 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,586 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:30,586 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,586 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:30,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,591 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-03 01:10:30,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-12-03 01:10:30,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,593 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,594 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,602 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,602 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,606 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,606 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,608 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-03 01:10:30,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,621 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,622 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,627 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,627 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,630 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,630 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,633 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,634 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:30,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,636 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:30,636 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,636 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-03 01:10:30,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,641 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-03 01:10:30,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,642 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,642 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,644 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,656 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,657 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,657 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,661 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,661 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,663 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-03 01:10:30,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,689 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,690 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,691 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,696 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,696 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,697 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,697 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,700 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,701 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,701 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,705 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,705 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,706 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:30,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,707 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,707 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,708 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:30,708 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:30,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:30,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,715 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-03 01:10:30,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,716 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:30,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,718 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,732 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:30,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,732 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,733 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,737 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:30,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,738 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,738 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,741 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-03 01:10:30,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,768 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:30,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,775 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:30,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,776 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,780 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:30,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,785 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:30,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,786 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,786 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,788 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:30,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,789 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:30,789 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,790 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:30,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,797 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-03 01:10:30,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,798 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,798 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,800 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,812 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,813 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,818 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,818 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,819 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,819 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,823 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-03 01:10:30,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,854 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,855 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,856 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,861 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,861 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,862 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,866 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,866 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,867 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,871 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,871 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,872 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,872 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:30,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,874 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:30,874 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:30,876 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-03 01:10:30,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,882 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-03 01:10:30,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,883 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,884 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,891 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,892 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,894 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,895 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,895 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,896 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-03 01:10:30,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,906 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,907 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,911 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,911 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,912 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,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-12-03 01:10:30,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,914 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,914 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,915 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,917 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,918 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:30,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,920 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:30,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,920 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:30,920 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:30,921 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:30,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,925 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-03 01:10:30,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-12-03 01:10:30,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,926 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,927 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:30,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:30,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,943 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,944 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:30,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:30,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,948 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,948 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,948 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-03 01:10:30,948 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:30,950 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-12-03 01:10:30,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,985 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,985 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:30,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:30,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,992 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,992 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:30,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:30,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:30,996 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:30,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:30,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:30,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:30,996 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:30,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:30,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:30,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:30,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:30,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:31,000 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:31,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,000 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:31,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:31,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:31,003 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:31,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,004 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:31,004 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:31,005 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-03 01:10:31,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:10:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:10:31,021 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-12-03 01:10:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:31,463 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-12-03 01:10:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:10:31,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-12-03 01:10:31,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-03 01:10:31,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-12-03 01:10:31,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-12-03 01:10:31,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-03 01:10:31,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-12-03 01:10:31,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:10:31,480 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-03 01:10:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-12-03 01:10:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-03 01:10:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-03 01:10:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-12-03 01:10:31,513 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-03 01:10:31,513 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-03 01:10:31,513 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-03 01:10:31,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-12-03 01:10:31,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-12-03 01:10:31,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:31,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:31,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 01:10:31,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:31,515 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-12-03 01:10:31,516 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-12-03 01:10:31,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-03 01:10:31,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:31,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:31,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:31,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:31,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:31,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-12-03 01:10:31,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:31,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:31,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:31,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:10:31,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:31,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-12-03 01:10:31,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:31,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:31,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:31,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:31,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:31,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:31,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 01:10:31,632 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:10:31,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:10:31,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:10:31,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:10:31,632 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-03 01:10:31,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:10:31,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:10:31,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label14_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-03 01:10:31,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:10:31,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:10:31,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,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-12-03 01:10:31,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,728 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:10:31,728 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:31,731 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:31,733 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:31,733 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:31,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:31,752 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:31,752 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:31,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:31,768 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:31,768 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:31,783 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:31,785 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:31,785 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:31,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:31,801 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:31,801 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:31,817 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-03 01:10:31,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:31,854 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-03 01:10:31,855 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:10:31,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:10:31,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:10:31,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:10:31,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-03 01:10:31,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:31,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:10:31,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:10:31,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label14_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-03 01:10:31,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:10:31,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:10:31,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:31,970 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:10:31,970 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-03 01:10:31,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:31,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:31,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,973 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:31,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:31,973 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:31,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:31,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:31,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:31,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:31,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,977 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:31,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:31,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:31,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,979 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:31,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:31,979 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:31,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:31,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:31,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-03 01:10:31,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-03 01:10:31,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,985 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-03 01:10:31,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,985 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:31,986 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:31,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,987 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:31,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:31,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:31,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,988 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:31,988 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:31,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:31,990 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:31,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,991 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:31,991 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:31,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:31,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,993 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:31,993 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:31,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:31,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,996 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:31,997 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:31,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:31,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:31,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:31,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:31,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:31,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:31,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:31,999 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:31,999 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:31,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,000 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-03 01:10:32,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,001 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,001 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,003 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,003 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,003 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,004 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,005 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,006 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,007 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,007 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,010 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,010 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,013 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,014 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,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-12-03 01:10:32,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,017 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,018 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-03 01:10:32,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,019 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,019 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,021 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,021 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-03 01:10:32,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,022 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,023 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,024 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,024 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,026 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,026 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,026 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-03 01:10:32,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,029 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,029 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,029 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-03 01:10:32,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,033 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,033 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-03 01:10:32,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,036 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,036 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,038 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-03 01:10:32,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:32,094 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:32,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,097 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,097 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:32,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:32,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,099 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,099 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:32,100 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:32,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,101 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,101 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,101 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:32,102 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:32,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,104 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,104 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,104 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:32,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:32,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,108 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,108 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,109 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:32,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:32,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,115 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,115 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:32,116 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:32,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,121 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,122 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-03 01:10:32,122 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-03 01:10:32,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,124 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-03 01:10:32,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,125 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:32,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,125 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,125 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,128 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:32,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,128 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,128 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,129 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,131 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:32,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,131 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,131 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,133 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:32,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,134 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,136 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:32,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,137 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,137 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,143 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:32,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,143 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,143 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,144 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,153 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:32,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,154 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,154 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,160 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,160 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-03 01:10:32,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,160 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,161 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,164 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-03 01:10:32,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,164 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,165 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,165 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,169 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,170 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,170 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,171 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-03 01:10:32,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,172 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,173 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,173 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,174 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,175 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,175 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,179 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,179 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,180 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,181 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-03 01:10:32,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,188 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,188 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,188 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,190 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-03 01:10:32,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,205 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,205 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,207 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,214 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,215 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-03 01:10:32,216 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-03 01:10:32,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,220 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-03 01:10:32,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,221 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,222 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,222 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,224 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,224 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,224 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,225 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,227 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,227 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,227 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,229 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,229 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,230 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,232 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,232 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,232 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,232 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,233 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,237 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,237 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,237 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,238 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-03 01:10:32,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,244 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,244 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,245 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,251 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,251 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-03 01:10:32,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-03 01:10:32,252 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-03 01:10:32,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,255 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-03 01:10:32,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,256 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,256 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:32,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:32,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,259 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,259 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,260 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:32,260 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-03 01:10:32,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,262 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,263 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:32,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:32,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,266 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,266 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,266 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:32,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:32,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,269 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,269 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,270 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,270 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:32,271 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-03 01:10:32,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,282 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,282 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-03 01:10:32,282 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:32,284 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-03 01:10:32,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,300 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,300 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:32,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:32,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-03 01:10:32,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-03 01:10:32,315 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-03 01:10:32,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-03 01:10:32,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-03 01:10:32,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-03 01:10:32,316 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-03 01:10:32,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-03 01:10:32,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-03 01:10:32,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-03 01:10:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:10:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:10:32,321 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-12-03 01:10:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:32,602 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-12-03 01:10:32,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:10:32,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-12-03 01:10:32,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-03 01:10:32,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-12-03 01:10:32,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-12-03 01:10:32,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-12-03 01:10:32,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-12-03 01:10:32,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:10:32,610 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-03 01:10:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-12-03 01:10:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-12-03 01:10:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-03 01:10:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-12-03 01:10:32,622 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-03 01:10:32,622 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-03 01:10:32,622 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-03 01:10:32,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-12-03 01:10:32,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-03 01:10:32,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:32,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:32,625 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 01:10:32,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:32,626 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-12-03 01:10:32,626 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-12-03 01:10:32,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:32,627 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-03 01:10:32,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:32,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:32,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:32,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:32,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:32,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-12-03 01:10:32,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:32,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:32,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:10:32,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:32,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:32,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:10:32,679 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-03 01:10:32,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:10:32,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:10:32,679 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-12-03 01:10:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:33,184 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-12-03 01:10:33,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:10:33,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-12-03 01:10:33,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-12-03 01:10:33,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-12-03 01:10:33,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-12-03 01:10:33,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-12-03 01:10:33,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-12-03 01:10:33,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:10:33,194 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-12-03 01:10:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-12-03 01:10:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-12-03 01:10:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-03 01:10:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-12-03 01:10:33,206 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-03 01:10:33,206 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-03 01:10:33,206 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-03 01:10:33,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-12-03 01:10:33,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-12-03 01:10:33,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:33,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:33,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 01:10:33,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:33,211 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-12-03 01:10:33,211 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-12-03 01:10:33,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:33,211 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-03 01:10:33,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:33,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:33,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:33,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:33,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-12-03 01:10:33,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:33,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:33,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:10:33,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 01:10:33,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:33,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:10:33,243 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-03 01:10:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:10:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:10:33,243 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-12-03 01:10:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:33,504 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-12-03 01:10:33,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:10:33,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-12-03 01:10:33,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-03 01:10:33,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-03 01:10:33,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-12-03 01:10:33,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-12-03 01:10:33,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-12-03 01:10:33,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:10:33,513 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-03 01:10:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-12-03 01:10:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-12-03 01:10:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-03 01:10:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-03 01:10:33,526 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-03 01:10:33,526 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-03 01:10:33,526 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-03 01:10:33,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-12-03 01:10:33,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-03 01:10:33,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:33,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:33,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 01:10:33,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:33,531 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-12-03 01:10:33,531 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-12-03 01:10:33,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:33,532 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-03 01:10:33,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:33,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:33,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:33,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:33,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-12-03 01:10:33,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:33,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:10:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 01:10:33,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:33,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:10:33,557 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-03 01:10:33,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:10:33,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:10:33,558 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-12-03 01:10:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:33,848 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-12-03 01:10:33,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:10:33,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-12-03 01:10:33,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-03 01:10:33,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-03 01:10:33,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-12-03 01:10:33,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-12-03 01:10:33,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-12-03 01:10:33,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:10:33,861 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-03 01:10:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-12-03 01:10:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-12-03 01:10:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-12-03 01:10:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-03 01:10:33,876 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-03 01:10:33,876 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-03 01:10:33,877 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-03 01:10:33,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-12-03 01:10:33,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-03 01:10:33,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:33,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:33,882 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 01:10:33,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:33,883 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-12-03 01:10:33,883 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-12-03 01:10:33,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-03 01:10:33,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:33,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:33,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:33,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:33,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:33,888 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-12-03 01:10:33,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:33,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:10:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:33,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:33,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:10:33,926 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-03 01:10:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:10:33,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:10:33,926 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-12-03 01:10:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:34,081 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-12-03 01:10:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:10:34,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-12-03 01:10:34,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-03 01:10:34,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-03 01:10:34,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-12-03 01:10:34,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-12-03 01:10:34,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-12-03 01:10:34,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:10:34,088 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-03 01:10:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-12-03 01:10:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-12-03 01:10:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-03 01:10:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-03 01:10:34,097 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-03 01:10:34,097 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-03 01:10:34,097 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-03 01:10:34,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-12-03 01:10:34,100 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-03 01:10:34,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:34,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:34,100 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-03 01:10:34,100 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:34,100 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-12-03 01:10:34,101 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-12-03 01:10:34,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:34,101 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-03 01:10:34,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:34,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:34,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:34,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-12-03 01:10:34,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:34,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:34,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:34,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:34,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-12-03 01:10:34,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:34,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:10:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:10:34,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:10:34,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 01:10:35,061 WARN L180 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-12-03 01:10:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:10:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:10:35,142 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-12-03 01:10:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:10:35,574 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-12-03 01:10:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:10:35,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-12-03 01:10:35,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-03 01:10:35,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-12-03 01:10:35,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-12-03 01:10:35,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-12-03 01:10:35,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-12-03 01:10:35,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-03 01:10:35,583 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-03 01:10:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-12-03 01:10:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-12-03 01:10:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-03 01:10:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-12-03 01:10:35,595 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-03 01:10:35,595 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-03 01:10:35,595 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-03 01:10:35,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-12-03 01:10:35,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-03 01:10:35,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-03 01:10:35,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-03 01:10:35,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-03 01:10:35,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:10:35,600 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2018-12-03 01:10:35,600 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2018-12-03 01:10:35,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:35,600 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-12-03 01:10:35,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:35,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:35,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:35,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:35,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:35,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-12-03 01:10:35,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:35,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:35,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:10:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-12-03 01:10:35,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:10:35,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:10:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:35,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:10:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:10:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:10:35,752 INFO L216 LassoAnalysis]: Preferences: [2018-12-03 01:10:35,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-03 01:10:35,752 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-03 01:10:35,752 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-03 01:10:35,752 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-03 01:10:35,752 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:35,752 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-03 01:10:35,752 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-03 01:10:35,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label14_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-12-03 01:10:35,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-03 01:10:35,753 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-03 01:10:35,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,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-12-03 01:10:35,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-03 01:10:35,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-12-03 01:10:35,913 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-03 01:10:35,914 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:35,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:35,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:35,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:35,918 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:35,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:35,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:35,935 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:35,935 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:35,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:35,950 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:35,952 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:35,952 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:35,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:35,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:35,968 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:35,968 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:35,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:35,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:35,984 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:35,985 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,001 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,017 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,019 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,019 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,036 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,051 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,053 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,053 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,068 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,070 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,086 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,086 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,103 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,119 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,119 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,121 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,121 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,138 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,139 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,162 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,162 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,177 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-03 01:10:36,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,342 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,342 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,359 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,359 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,373 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,375 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,375 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,389 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,389 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-03 01:10:36,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,538 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,539 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,553 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,555 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,555 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_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-03 01:10:36,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-03 01:10:36,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-03 01:10:36,571 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-03 01:10:36,571 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-12-03 01:10:36,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 03.12 01:10:36 BoogieIcfgContainer [2018-12-03 01:10:36,603 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-03 01:10:36,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:10:36,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:10:36,604 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:10:36,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:10:29" (3/4) ... [2018-12-03 01:10:36,606 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-03 01:10:36,639 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_93538967-92ba-4e64-897d-1e03b63c1811/bin-2019/uautomizer/witness.graphml [2018-12-03 01:10:36,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:10:36,640 INFO L168 Benchmark]: Toolchain (without parser) took 8109.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.9 MB). Free memory was 951.7 MB in the beginning and 1.3 GB in the end (delta: -351.5 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:36,640 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:10:36,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:36,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:36,641 INFO L168 Benchmark]: Boogie Preprocessor took 28.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:10:36,641 INFO L168 Benchmark]: RCFGBuilder took 585.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 938.1 MB in the end (delta: 117.5 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:36,641 INFO L168 Benchmark]: BuchiAutomizer took 7114.32 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 938.1 MB in the beginning and 1.3 GB in the end (delta: -365.1 MB). Peak memory consumption was 536.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:10:36,641 INFO L168 Benchmark]: Witness Printer took 36.07 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:10:36,643 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 585.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 938.1 MB in the end (delta: 117.5 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7114.32 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 938.1 MB in the beginning and 1.3 GB in the end (delta: -365.1 MB). Peak memory consumption was 536.7 MB. Max. memory is 11.5 GB. * Witness Printer took 36.07 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.4s. Construction of modules took 1.7s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s 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: 36ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a6ef5e0=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b96232e=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@7a6ef5e0=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b96232e=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@7a6ef5e0=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@7b96232e=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...