./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label19_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_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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 e94bad701dc31ef8837df5dc0d8bbaaa41b948fd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-09 05:40:52,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:40:52,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:40:52,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:40:52,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:40:52,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:40:52,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:40:52,971 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:40:52,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:40:52,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:40:52,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:40:52,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:40:52,973 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:40:52,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:40:52,974 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:40:52,975 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:40:52,975 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:40:52,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:40:52,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:40:52,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:40:52,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:40:52,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:40:52,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:40:52,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:40:52,980 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:40:52,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:40:52,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:40:52,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:40:52,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:40:52,982 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:40:52,982 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:40:52,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:40:52,982 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:40:52,982 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:40:52,983 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:40:52,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:40:52,983 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 05:40:52,991 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:40:52,991 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:40:52,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:40:52,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:40:52,992 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 05:40:52,992 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 05:40:52,992 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 05:40:52,992 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 05:40:52,992 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 05:40:52,992 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 05:40:52,992 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 05:40:52,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:40:52,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:40:52,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:40:52,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 05:40:52,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:40:52,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:40:52,994 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 05:40:52,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:40:52,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 05:40:52,994 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 05:40:52,994 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 05:40:52,995 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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 -> e94bad701dc31ef8837df5dc0d8bbaaa41b948fd [2018-12-09 05:40:53,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:40:53,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:40:53,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:40:53,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:40:53,024 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:40:53,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c [2018-12-09 05:40:53,067 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/data/a39536f5f/e784c30c32884dbfa0be208d0b2bb7e0/FLAG6d2029a9b [2018-12-09 05:40:53,418 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:40:53,418 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/sv-benchmarks/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c [2018-12-09 05:40:53,426 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/data/a39536f5f/e784c30c32884dbfa0be208d0b2bb7e0/FLAG6d2029a9b [2018-12-09 05:40:53,805 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/data/a39536f5f/e784c30c32884dbfa0be208d0b2bb7e0 [2018-12-09 05:40:53,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:40:53,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:40:53,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:40:53,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:40:53,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:40:53,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:40:53" (1/1) ... [2018-12-09 05:40:53,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da07790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:53, skipping insertion in model container [2018-12-09 05:40:53,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:40:53" (1/1) ... [2018-12-09 05:40:53,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:40:53,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:40:54,011 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:40:54,014 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:40:54,060 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:40:54,112 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:40:54,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54 WrapperNode [2018-12-09 05:40:54,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:40:54,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:40:54,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:40:54,113 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:40:54,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:40:54,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:40:54,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:40:54,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:40:54,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... [2018-12-09 05:40:54,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:40:54,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:40:54,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:40:54,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:40:54,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:40:54,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:40:54,812 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:40:54,813 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 05:40:54,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:40:54 BoogieIcfgContainer [2018-12-09 05:40:54,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:40:54,814 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 05:40:54,814 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 05:40:54,817 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 05:40:54,817 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 05:40:54,817 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 05:40:53" (1/3) ... [2018-12-09 05:40:54,818 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2641a868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 05:40:54, skipping insertion in model container [2018-12-09 05:40:54,818 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 05:40:54,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:40:54" (2/3) ... [2018-12-09 05:40:54,819 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2641a868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 05:40:54, skipping insertion in model container [2018-12-09 05:40:54,819 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 05:40:54,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:40:54" (3/3) ... [2018-12-09 05:40:54,820 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label19_true-unreach-call_false-termination.c [2018-12-09 05:40:54,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:40:54,864 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 05:40:54,864 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 05:40:54,864 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 05:40:54,864 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:40:54,864 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:40:54,864 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 05:40:54,865 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:40:54,865 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 05:40:54,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-09 05:40:54,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-09 05:40:54,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:40:54,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:40:54,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 05:40:54,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 05:40:54,915 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 05:40:54,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-09 05:40:54,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-09 05:40:54,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:40:54,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:40:54,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 05:40:54,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 05:40:54,928 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-09 05:40:54,929 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-09 05:40:54,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 05:40:54,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:54,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:54,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:54,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:55,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-12-09 05:40:55,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:55,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:55,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:55,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:55,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:55,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-12-09 05:40:55,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:55,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:55,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:55,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:55,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:40:55,087 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-09 05:40:55,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:40:55,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 05:40:55,196 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 05:40:55,197 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 05:40:55,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 05:40:55,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 05:40:55,197 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 05:40:55,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 05:40:55,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 05:40:55,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 05:40:55,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-09 05:40:55,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 05:40:55,198 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 05:40:55,220 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-09 05:40:55,224 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-09 05:40:55,241 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-09 05:40:55,248 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-09 05:40:55,249 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-09 05:40:55,251 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-09 05:40:55,252 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-09 05:40:55,264 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-09 05:40:55,415 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 05:40:55,415 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:55,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:55,423 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:55,423 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:55,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:55,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:55,442 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:55,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:55,460 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:55,460 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:55,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:55,485 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:55,485 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:55,500 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:55,503 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:55,503 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:55,518 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:55,520 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:55,521 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:55,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:55,549 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:55,549 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,564 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:55,564 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:55,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 05:40:55,581 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:55,602 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 05:40:55,603 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 05:40:55,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 05:40:55,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 05:40:55,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 05:40:55,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 05:40:55,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 05:40:55,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 05:40:55,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 05:40:55,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-09 05:40:55,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 05:40:55,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 05:40:55,605 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-09 05:40:55,612 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-09 05:40:55,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 05:40:55,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 05:40:55,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-09 05:40:55,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-09 05:40:55,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-09 05:40:55,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 05:40:55,816 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 05:40:55,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 05:40:55,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:55,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:55,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:55,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:55,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,836 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:55,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:55,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:55,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:55,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:55,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:55,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:55,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:55,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:55,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:55,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:55,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,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-09 05:40:55,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,861 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:55,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:55,861 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:55,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,864 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-09 05:40:55,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:55,866 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:55,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,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-09 05:40:55,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,872 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:55,872 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:55,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,875 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:55,875 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:55,876 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-09 05:40:55,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,887 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:55,887 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:55,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,891 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:55,891 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:55,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,894 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:55,894 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:55,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,896 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:55,897 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:55,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,898 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:55,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:55,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:55,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,902 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-09 05:40:55,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:55,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:55,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:55,910 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:55,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,912 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:55,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:55,929 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 05:40:55,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,943 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:55,944 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:55,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,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-09 05:40:55,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,948 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:55,949 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:55,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,952 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:55,952 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:55,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,955 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:55,955 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:55,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,957 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:55,958 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:55,958 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:55,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,963 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-09 05:40:55,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,964 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:55,965 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:55,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,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-09 05:40:55,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:55,972 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:55,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,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-09 05:40:55,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,975 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:55,975 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:55,976 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-09 05:40:55,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,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-09 05:40:55,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,990 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:55,991 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:55,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,995 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:55,995 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:55,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:55,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:55,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:55,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:55,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:55,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:55,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:55,998 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:55,999 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:55,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:56,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,002 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,002 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:56,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,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-09 05:40:56,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:56,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,003 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:56,003 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,004 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 05:40:56,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,007 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-09 05:40:56,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-09 05:40:56,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,008 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:56,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:56,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,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-09 05:40:56,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,021 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,021 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:56,021 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:56,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,024 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,025 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:56,025 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:56,026 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-09 05:40:56,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,052 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,053 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:56,053 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:56,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,058 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,058 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:56,059 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:56,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,062 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,063 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:56,063 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:56,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,066 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:56,067 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:56,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,068 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,068 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:56,068 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:56,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:56,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,072 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-09 05:40:56,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,073 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,073 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:56,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,074 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,075 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,084 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,084 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:56,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,085 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,088 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,088 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:56,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,088 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:56,088 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,089 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 05:40:56,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,111 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,111 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:56,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,111 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,112 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,116 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:56,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,116 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,117 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,119 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:56,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,119 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,120 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,122 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:56,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,123 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,123 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,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-09 05:40:56,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,124 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:56,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,125 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:56,125 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,125 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:56,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,131 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-09 05:40:56,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,132 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,132 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,133 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:56,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,140 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,141 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,141 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:56,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,145 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,145 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:56,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,148 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-09 05:40:56,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,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-09 05:40:56,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,174 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,174 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,175 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:56,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,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-09 05:40:56,180 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,180 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,180 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,181 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:56,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,184 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,184 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,185 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:56,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,188 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,188 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,188 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:56,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,189 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,190 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:56,190 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:56,191 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 05:40:56,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,197 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-09 05:40:56,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,197 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,198 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,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-09 05:40:56,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,205 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,205 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,206 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,208 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,209 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:56,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,210 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 05:40:56,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,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-09 05:40:56,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,221 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,222 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,222 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,225 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,225 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,226 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,226 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,228 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,228 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,228 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,230 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,230 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,231 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:56,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,232 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,232 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:56,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,232 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:56,232 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:56,233 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:56,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,237 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-09 05:40:56,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,238 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,238 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,238 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:56,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:56,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,258 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,258 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:56,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:56,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,261 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,261 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 05:40:56,262 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:56,264 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-12-09 05:40:56,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,313 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,314 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:56,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:56,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,319 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,320 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:56,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:56,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,323 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,323 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,323 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:56,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:56,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,327 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,327 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:56,327 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:56,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:56,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:56,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:56,331 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:56,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:56,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:56,331 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:56,332 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:56,332 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 05:40:56,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:56,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:40:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:40:56,348 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-12-09 05:40:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:40:56,803 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-12-09 05:40:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:40:56,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-12-09 05:40:56,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-09 05:40:56,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-12-09 05:40:56,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-12-09 05:40:56,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-09 05:40:56,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-12-09 05:40:56,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 05:40:56,819 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-09 05:40:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-12-09 05:40:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-09 05:40:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-09 05:40:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-12-09 05:40:56,849 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-09 05:40:56,850 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-09 05:40:56,850 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 05:40:56,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-12-09 05:40:56,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-12-09 05:40:56,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:40:56,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:40:56,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 05:40:56,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:40:56,852 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-09 05:40:56,852 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-09 05:40:56,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:56,852 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-09 05:40:56,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:56,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:56,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:56,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:56,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:56,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-12-09 05:40:56,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:56,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:56,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:40:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:56,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:56,869 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-12-09 05:40:56,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:56,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:56,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:56,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:40:56,879 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-09 05:40:56,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:40:56,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 05:40:56,948 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 05:40:56,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 05:40:56,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 05:40:56,949 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 05:40:56,949 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 05:40:56,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 05:40:56,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 05:40:56,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 05:40:56,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-09 05:40:56,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 05:40:56,949 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 05:40:56,950 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-09 05:40:56,952 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-09 05:40:56,954 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-09 05:40:56,956 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-09 05:40:56,957 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-09 05:40:56,958 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-09 05:40:56,961 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-09 05:40:56,965 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-09 05:40:57,076 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 05:40:57,076 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:57,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:57,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:57,080 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:57,080 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:57,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:57,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:57,099 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:57,100 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:57,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:57,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:57,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:57,125 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:57,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:57,140 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:57,142 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:57,142 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:57,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:57,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:57,159 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:40:57,159 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:57,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:40:57,174 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:40:57,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 05:40:57,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:40:57,211 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 05:40:57,213 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 05:40:57,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 05:40:57,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 05:40:57,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 05:40:57,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 05:40:57,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 05:40:57,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 05:40:57,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 05:40:57,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-09 05:40:57,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 05:40:57,214 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 05:40:57,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 05:40:57,217 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-09 05:40:57,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 05:40:57,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 05:40:57,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 05:40:57,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 05:40:57,260 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-09 05:40:57,266 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-09 05:40:57,361 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 05:40:57,361 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 05:40:57,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:57,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:57,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,364 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:57,364 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:57,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:57,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:57,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:57,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,368 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:57,368 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,370 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:57,371 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:57,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:57,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 05:40:57,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 05:40:57,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,376 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-09 05:40:57,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,377 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,377 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,379 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,379 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,380 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,380 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,381 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,381 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,383 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,386 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,386 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,390 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,391 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,393 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,394 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,395 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-09 05:40:57,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,395 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,396 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,397 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,398 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,455 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,456 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,457 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,457 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,459 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,459 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,459 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,461 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,461 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,461 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,464 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,464 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,467 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,467 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,469 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-09 05:40:57,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-09 05:40:57,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,470 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,470 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,471 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,471 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,472 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 05:40:57,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,472 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,473 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,474 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,474 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,475 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,475 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,476 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 05:40:57,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,478 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,478 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 05:40:57,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,481 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,482 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 05:40:57,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,484 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,484 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,486 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-09 05:40:57,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,486 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,486 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,487 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,487 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,488 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,489 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,489 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,490 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,490 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,490 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,491 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,492 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,493 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,493 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,493 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,493 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,496 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,496 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,496 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,496 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,501 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,501 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,501 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,505 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,505 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 05:40:57,506 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 05:40:57,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,507 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-09 05:40:57,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,507 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:57,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,510 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,510 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:57,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,510 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,510 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,511 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,512 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:57,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,513 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:57,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,513 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,514 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,516 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:57,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,516 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,516 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,520 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:57,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,520 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,521 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,527 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:57,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,527 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,531 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 05:40:57,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,531 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,532 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,534 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-09 05:40:57,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-09 05:40:57,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,534 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,535 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,535 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,538 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,538 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,538 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,538 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 05:40:57,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,539 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,540 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,540 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,541 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,541 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,542 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,544 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,544 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,544 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,545 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,545 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 05:40:57,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,550 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,550 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,551 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,552 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 05:40:57,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,562 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,562 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,563 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,568 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,568 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 05:40:57,569 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 05:40:57,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,572 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-09 05:40:57,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,573 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,573 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,573 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,574 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,575 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,575 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,575 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,576 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,577 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,577 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,578 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,580 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,580 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,580 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,580 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,580 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,583 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,583 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,583 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,584 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 05:40:57,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,588 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,588 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,588 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,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-09 05:40:57,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,593 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 05:40:57,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 05:40:57,593 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 05:40:57,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,595 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-09 05:40:57,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,595 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,596 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:57,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,598 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,598 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,598 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:57,598 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 05:40:57,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,600 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,600 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:57,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,602 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,602 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:57,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,604 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,604 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,604 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:57,605 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 05:40:57,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,612 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,612 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 05:40:57,612 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:57,613 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 05:40:57,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,622 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,623 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:57,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 05:40:57,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 05:40:57,632 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 05:40:57,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 05:40:57,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 05:40:57,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 05:40:57,633 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 05:40:57,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 05:40:57,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 05:40:57,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 05:40:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:40:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:40:57,637 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-12-09 05:40:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:40:57,957 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-12-09 05:40:57,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:40:57,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-12-09 05:40:57,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-09 05:40:57,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-12-09 05:40:57,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-12-09 05:40:57,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-12-09 05:40:57,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-12-09 05:40:57,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 05:40:57,966 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-09 05:40:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-12-09 05:40:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-12-09 05:40:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-09 05:40:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-12-09 05:40:57,980 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-09 05:40:57,980 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-09 05:40:57,980 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 05:40:57,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-12-09 05:40:57,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-09 05:40:57,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:40:57,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:40:57,984 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 05:40:57,984 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-09 05:40:57,984 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-09 05:40:57,985 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-09 05:40:57,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-09 05:40:57,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:57,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:57,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:57,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-12-09 05:40:57,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:57,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:57,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:40:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:40:58,043 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-09 05:40:58,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:40:58,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:40:58,043 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 05:40:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:40:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:40:58,044 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-12-09 05:40:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:40:58,510 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-12-09 05:40:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:40:58,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-12-09 05:40:58,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-12-09 05:40:58,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-12-09 05:40:58,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-12-09 05:40:58,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-12-09 05:40:58,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-12-09 05:40:58,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 05:40:58,520 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-12-09 05:40:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-12-09 05:40:58,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-12-09 05:40:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-09 05:40:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-12-09 05:40:58,535 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-09 05:40:58,535 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-09 05:40:58,535 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 05:40:58,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-12-09 05:40:58,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-12-09 05:40:58,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:40:58,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:40:58,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 05:40:58,540 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-09 05:40:58,540 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-09 05:40:58,540 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-09 05:40:58,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-09 05:40:58,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:58,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:58,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:58,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:58,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-12-09 05:40:58,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:58,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:40:58,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:40:58,569 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-09 05:40:58,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:40:58,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:40:58,570 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 05:40:58,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:40:58,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:40:58,570 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-12-09 05:40:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:40:58,838 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-12-09 05:40:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:40:58,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-12-09 05:40:58,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-09 05:40:58,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-09 05:40:58,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-12-09 05:40:58,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-12-09 05:40:58,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-12-09 05:40:58,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 05:40:58,851 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-09 05:40:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-12-09 05:40:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-12-09 05:40:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-09 05:40:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-09 05:40:58,904 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-09 05:40:58,904 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-09 05:40:58,904 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 05:40:58,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-12-09 05:40:58,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-09 05:40:58,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:40:58,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:40:58,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 05:40:58,910 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-09 05:40:58,910 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-09 05:40:58,910 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-09 05:40:58,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-09 05:40:58,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:58,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:58,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:58,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-12-09 05:40:58,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:58,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:58,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:40:58,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:40:58,937 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-09 05:40:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:40:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:40:58,937 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 05:40:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:40:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:40:58,938 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-12-09 05:40:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:40:59,211 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-12-09 05:40:59,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:40:59,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-12-09 05:40:59,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-09 05:40:59,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-09 05:40:59,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-12-09 05:40:59,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-12-09 05:40:59,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-12-09 05:40:59,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 05:40:59,219 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-09 05:40:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-12-09 05:40:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-12-09 05:40:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-12-09 05:40:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-09 05:40:59,228 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-09 05:40:59,228 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-09 05:40:59,228 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 05:40:59,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-12-09 05:40:59,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-09 05:40:59,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:40:59,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:40:59,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 05:40:59,231 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-09 05:40:59,231 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-09 05:40:59,231 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-09 05:40:59,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-09 05:40:59,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:59,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:59,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-12-09 05:40:59,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:59,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:59,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:40:59,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:40:59,265 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-09 05:40:59,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:40:59,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:40:59,265 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 05:40:59,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:40:59,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:40:59,266 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-12-09 05:40:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:40:59,407 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-12-09 05:40:59,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:40:59,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-12-09 05:40:59,410 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-09 05:40:59,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-09 05:40:59,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-12-09 05:40:59,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-12-09 05:40:59,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-12-09 05:40:59,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 05:40:59,414 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-09 05:40:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-12-09 05:40:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-12-09 05:40:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-09 05:40:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-09 05:40:59,422 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-09 05:40:59,422 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-09 05:40:59,422 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 05:40:59,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-12-09 05:40:59,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-09 05:40:59,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:40:59,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:40:59,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 05:40:59,425 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-09 05:40:59,425 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-09 05:40:59,426 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-09 05:40:59,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:59,426 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-09 05:40:59,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:59,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:59,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-12-09 05:40:59,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:59,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:59,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:59,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:40:59,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:40:59,453 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-12-09 05:40:59,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:40:59,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:40:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:40:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:40:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:40:59,761 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-09 05:40:59,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:40:59,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 05:41:00,392 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-12-09 05:41:00,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:41:00,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:41:00,464 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-12-09 05:41:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:41:00,892 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-12-09 05:41:00,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:41:00,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-12-09 05:41:00,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-09 05:41:00,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-12-09 05:41:00,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-12-09 05:41:00,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-12-09 05:41:00,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-12-09 05:41:00,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 05:41:00,902 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-09 05:41:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-12-09 05:41:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-12-09 05:41:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-09 05:41:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-12-09 05:41:00,914 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-09 05:41:00,914 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-09 05:41:00,914 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 05:41:00,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-12-09 05:41:00,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-09 05:41:00,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 05:41:00,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 05:41:00,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 05:41:00,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:41:00,919 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-09 05:41:00,919 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-09 05:41:00,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:00,919 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-12-09 05:41:00,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:41:00,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:41:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:00,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:00,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-12-09 05:41:00,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:41:00,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:41:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:00,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:00,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:41:00,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-12-09 05:41:00,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:41:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:41:00,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:00,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:41:00,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:41:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:41:01,071 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 05:41:01,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 05:41:01,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 05:41:01,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 05:41:01,072 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 05:41:01,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 05:41:01,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 05:41:01,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 05:41:01,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-12-09 05:41:01,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 05:41:01,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 05:41:01,073 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-09 05:41:01,077 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-09 05:41:01,078 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-09 05:41:01,079 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-09 05:41:01,080 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-09 05:41:01,081 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-09 05:41:01,083 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-09 05:41:01,084 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-09 05:41:01,086 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-09 05:41:01,087 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-09 05:41:01,088 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-09 05:41:01,089 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-09 05:41:01,090 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-09 05:41:01,092 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-09 05:41:01,093 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-09 05:41:01,094 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-09 05:41:01,100 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-09 05:41:01,102 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-09 05:41:01,105 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-09 05:41:01,110 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-09 05:41:01,112 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-09 05:41:01,235 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 05:41:01,235 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,239 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,240 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,254 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,256 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,256 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,273 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,287 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,290 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,306 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,323 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,323 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,339 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,340 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,356 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,356 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,371 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,371 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,373 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,389 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,389 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,403 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,405 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,405 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,422 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,422 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,440 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,461 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,464 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,482 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,482 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,496 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 05:41:01,514 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,661 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,661 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,678 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,695 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,710 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 05:41:01,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,863 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,863 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,877 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,879 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,879 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_f9a08705-60f9-469d-87cb-ead68d1255f8/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-09 05:41:01,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 05:41:01,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 05:41:01,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 05:41:01,896 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-12-09 05:41:01,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 05:41:01 BoogieIcfgContainer [2018-12-09 05:41:01,926 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 05:41:01,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:41:01,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:41:01,926 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:41:01,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:40:54" (3/4) ... [2018-12-09 05:41:01,929 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 05:41:01,955 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f9a08705-60f9-469d-87cb-ead68d1255f8/bin-2019/uautomizer/witness.graphml [2018-12-09 05:41:01,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:41:01,956 INFO L168 Benchmark]: Toolchain (without parser) took 8147.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 476.1 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -392.1 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:01,956 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:41:01,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:01,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:01,957 INFO L168 Benchmark]: Boogie Preprocessor took 41.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:01,957 INFO L168 Benchmark]: RCFGBuilder took 616.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 117.1 MB). Peak memory consumption was 117.1 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:01,957 INFO L168 Benchmark]: BuchiAutomizer took 7112.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 992.2 MB in the beginning and 1.4 GB in the end (delta: -361.6 MB). Peak memory consumption was 548.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:01,957 INFO L168 Benchmark]: Witness Printer took 29.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:41:01,958 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 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.2 GB in the end (delta: 128.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 616.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 117.1 MB). Peak memory consumption was 117.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7112.24 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 992.2 MB in the beginning and 1.4 GB in the end (delta: -361.6 MB). Peak memory consumption was 548.3 MB. Max. memory is 11.5 GB. * Witness Printer took 29.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.3s. 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.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: 52ms 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@1a73670b=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8b74e15=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@1a73670b=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8b74e15=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@1a73670b=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@8b74e15=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...