./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label52_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label52_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/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 b953cc2449a7f939fba62b70833772464a0d90fd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-aa41828 [2018-11-23 03:51:36,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:51:36,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:51:36,119 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:51:36,119 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:51:36,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:51:36,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:51:36,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:51:36,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:51:36,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:51:36,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:51:36,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:51:36,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:51:36,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:51:36,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:51:36,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:51:36,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:51:36,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:51:36,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:51:36,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:51:36,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:51:36,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:51:36,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:51:36,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:51:36,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:51:36,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:51:36,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:51:36,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:51:36,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:51:36,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:51:36,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:51:36,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:51:36,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:51:36,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:51:36,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:51:36,140 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:51:36,141 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 03:51:36,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:51:36,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:51:36,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:51:36,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:51:36,153 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:51:36,154 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:51:36,154 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:51:36,154 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:51:36,154 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:51:36,154 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:51:36,154 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:51:36,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:51:36,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:51:36,155 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:51:36,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:51:36,155 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:51:36,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:51:36,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:51:36,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:51:36,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:51:36,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:51:36,156 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:51:36,156 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:51:36,156 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:51:36,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:51:36,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:51:36,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:51:36,156 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:51:36,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:51:36,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:51:36,158 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:51:36,159 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:51:36,159 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_2b4af83c-e8f0-4116-b624-88115d7880a7/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 -> b953cc2449a7f939fba62b70833772464a0d90fd [2018-11-23 03:51:36,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:51:36,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:51:36,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:51:36,197 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:51:36,197 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:51:36,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label52_true-unreach-call_false-termination.c [2018-11-23 03:51:36,243 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/data/8744eb96b/8182e671a86f459b90d2511fd19efcaa/FLAG64d3470c4 [2018-11-23 03:51:36,629 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:51:36,630 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/sv-benchmarks/c/eca-rers2012/Problem02_label52_true-unreach-call_false-termination.c [2018-11-23 03:51:36,639 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/data/8744eb96b/8182e671a86f459b90d2511fd19efcaa/FLAG64d3470c4 [2018-11-23 03:51:37,000 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/data/8744eb96b/8182e671a86f459b90d2511fd19efcaa [2018-11-23 03:51:37,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:51:37,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:51:37,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:51:37,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:51:37,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:51:37,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e42f8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37, skipping insertion in model container [2018-11-23 03:51:37,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:51:37,050 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:51:37,261 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:51:37,264 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:51:37,329 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:51:37,342 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:51:37,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37 WrapperNode [2018-11-23 03:51:37,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:51:37,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:51:37,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:51:37,343 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:51:37,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:51:37,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:51:37,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:51:37,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:51:37,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... [2018-11-23 03:51:37,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:51:37,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:51:37,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:51:37,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:51:37,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 03:51:37,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:51:37,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:51:38,381 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:51:38,381 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 03:51:38,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:38 BoogieIcfgContainer [2018-11-23 03:51:38,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:51:38,383 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:51:38,383 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:51:38,385 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:51:38,385 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:51:38,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:51:37" (1/3) ... [2018-11-23 03:51:38,386 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@596aaf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:51:38, skipping insertion in model container [2018-11-23 03:51:38,387 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:51:38,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:37" (2/3) ... [2018-11-23 03:51:38,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@596aaf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:51:38, skipping insertion in model container [2018-11-23 03:51:38,388 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:51:38,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:38" (3/3) ... [2018-11-23 03:51:38,389 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label52_true-unreach-call_false-termination.c [2018-11-23 03:51:38,425 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:51:38,426 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:51:38,426 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:51:38,426 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:51:38,426 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:51:38,426 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:51:38,426 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:51:38,426 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:51:38,427 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:51:38,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 03:51:38,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 03:51:38,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:38,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:38,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:51:38,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:51:38,471 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:51:38,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 03:51:38,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 03:51:38,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:38,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:38,478 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:51:38,478 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:51:38,483 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-11-23 03:51:38,483 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-11-23 03:51:38,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 03:51:38,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:38,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:38,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:38,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:38,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:38,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-23 03:51:38,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:38,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:38,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:38,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-23 03:51:38,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:38,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:38,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:38,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:51:38,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:51:38,783 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:51:38,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:51:38,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:51:38,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:51:38,784 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:51:38,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:38,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:51:38,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:51:38,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label52_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 03:51:38,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:51:38,786 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:51:38,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:38,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:38,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:38,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:38,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:38,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:38,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:38,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,019 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:51:39,020 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:39,024 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:39,032 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:39,032 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:39,051 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:39,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:39,074 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:39,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:39,097 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:39,097 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:39,115 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:39,118 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:39,118 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:39,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:39,142 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:39,143 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:39,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:39,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:39,169 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:39,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:39,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:39,194 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:39,215 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:51:39,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:39,284 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:51:39,286 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:51:39,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:51:39,286 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:51:39,286 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:51:39,286 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:51:39,286 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:39,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:51:39,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:51:39,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label52_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 03:51:39,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:51:39,287 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:51:39,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:39,488 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:51:39,491 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:51:39,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:39,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:39,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,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-11-23 03:51:39,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:39,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:39,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,512 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:39,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:39,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:39,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:39,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:39,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:39,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:39,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:39,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:39,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:39,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:39,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,552 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:39,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:39,556 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,561 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 03:51:39,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,562 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,563 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,575 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,575 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,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-11-23 03:51:39,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,580 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:39,580 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,582 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 03:51:39,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,597 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,598 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,604 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,604 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,609 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,609 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,612 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,613 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:39,618 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:39,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,625 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 03:51:39,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,627 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,630 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,637 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,638 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,642 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:39,642 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,643 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:51:39,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,655 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,683 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,683 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,688 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,692 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:39,692 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,697 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:39,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,700 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 03:51:39,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,702 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,702 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,710 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,715 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:39,715 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,717 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 03:51:39,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,729 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,729 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,733 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,734 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,736 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,737 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,740 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,740 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:39,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,744 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:39,745 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,745 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:51:39,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,749 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 03:51:39,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,750 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:39,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,750 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,754 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,766 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,766 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:39,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,766 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,767 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,770 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:39,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,771 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:39,771 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,772 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 03:51:39,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:39,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,798 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,799 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,803 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:39,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,803 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,803 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,806 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:39,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,807 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,812 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,815 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:39,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,816 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,816 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:39,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,818 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,818 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:39,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,818 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:39,818 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:39,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:39,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,824 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 03:51:39,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,824 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:39,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,826 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,837 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:39,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,838 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,842 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:39,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,842 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:39,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,845 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:51:39,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,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-11-23 03:51:39,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,872 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:39,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,878 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:39,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,879 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,883 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:39,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,884 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,888 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:39,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:39,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,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-11-23 03:51:39,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,890 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:39,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,891 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:39,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:39,892 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:39,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,898 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 03:51:39,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-11-23 03:51:39,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,899 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:39,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,899 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,901 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,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-11-23 03:51:39,912 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,913 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:39,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,913 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,914 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,919 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:39,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,919 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:39,919 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,923 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 03:51:39,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,960 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:39,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,964 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,973 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:39,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,974 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,978 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,978 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:39,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,979 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,980 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,984 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:39,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:39,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,985 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:39,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:39,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:39,987 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:39,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:39,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:39,987 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:39,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:39,989 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:51:39,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:39,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:39,999 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 03:51:39,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,000 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:40,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,000 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:40,001 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:40,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,010 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:40,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:40,011 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:40,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:40,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,016 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:40,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:40,017 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:51:40,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,034 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:40,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,034 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:40,035 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:40,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:40,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:40,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:40,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,042 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:40,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,042 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:40,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:40,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,045 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:40,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,046 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:40,046 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:40,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,048 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:40,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,048 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:40,048 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:40,049 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:40,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,054 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 03:51:40,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,055 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:40,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,055 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:40,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:40,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,081 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:40,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,082 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:40,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:40,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,085 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:40,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,086 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:51:40,086 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:40,088 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 03:51:40,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,159 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:40,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,160 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:40,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:40,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,170 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:40,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,170 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:40,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:40,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,174 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:40,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,174 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:40,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:40,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,178 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,178 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:40,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:40,178 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:40,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:40,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:40,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:40,181 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:40,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:40,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:40,182 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:40,182 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:40,183 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:51:40,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:40,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:40,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:51:40,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:51:40,206 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-23 03:51:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:51:40,920 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2018-11-23 03:51:40,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:51:40,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 546 transitions. [2018-11-23 03:51:40,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 370 [2018-11-23 03:51:40,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 372 states and 539 transitions. [2018-11-23 03:51:40,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-23 03:51:40,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-11-23 03:51:40,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 539 transitions. [2018-11-23 03:51:40,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:51:40,940 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 539 transitions. [2018-11-23 03:51:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 539 transitions. [2018-11-23 03:51:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-11-23 03:51:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-23 03:51:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 537 transitions. [2018-11-23 03:51:40,969 INFO L728 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 03:51:40,969 INFO L608 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 03:51:40,969 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:51:40,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 537 transitions. [2018-11-23 03:51:40,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 369 [2018-11-23 03:51:40,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:40,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:40,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:51:40,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:51:40,972 INFO L794 eck$LassoCheckResult]: Stem: 748#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; 628#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 629#L606-2 [2018-11-23 03:51:40,972 INFO L796 eck$LassoCheckResult]: Loop: 629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 730#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; 731#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); 865#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 754#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); 693#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 694#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); 841#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 630#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; 631#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 629#L606-2 [2018-11-23 03:51:40,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 03:51:40,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:40,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:40,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:40,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:40,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:40,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:40,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-23 03:51:40,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:40,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:40,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:40,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:51:40,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:40,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-23 03:51:40,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:40,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:40,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:41,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:51:41,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:51:41,108 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:51:41,108 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:51:41,108 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:51:41,108 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:51:41,109 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:51:41,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:51:41,109 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:51:41,109 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label52_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 03:51:41,109 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:51:41,109 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:51:41,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-11-23 03:51:41,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,235 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:51:41,236 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:41,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:41,240 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:41,240 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:41,256 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:41,259 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:41,259 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:41,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:41,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:41,280 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:41,298 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:41,300 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:41,301 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:41,316 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:41,318 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:41,319 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:41,337 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:51:41,360 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:41,381 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:51:41,383 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:51:41,383 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:51:41,383 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:51:41,383 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:51:41,383 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:51:41,383 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:41,383 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:51:41,383 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:51:41,383 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label52_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 03:51:41,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:51:41,384 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:51:41,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:41,572 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:51:41,572 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:51:41,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:41,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:41,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:41,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:41,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,582 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:41,582 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,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-11-23 03:51:41,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:41,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:41,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:41,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:41,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,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-11-23 03:51:41,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,588 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:41,588 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,590 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:41,591 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:41,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:41,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,595 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 03:51:41,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,596 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,596 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,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-11-23 03:51:41,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,598 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,598 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,600 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,601 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,602 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,602 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,604 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,604 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,606 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,606 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,608 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,608 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,612 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,613 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,615 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 03:51:41,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,621 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,621 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,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-11-23 03:51:41,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,622 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,623 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,624 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,624 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,626 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,626 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,629 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,629 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,630 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,634 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,635 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,637 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 03:51:41,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,638 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,638 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,640 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,641 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,643 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,643 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,643 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:51:41,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,644 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,644 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,646 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,646 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,648 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,649 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,649 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:51:41,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,652 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,652 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,653 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:51:41,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:41,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,657 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,657 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,660 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 03:51:41,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,661 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,662 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,664 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,664 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,665 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,665 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,668 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,669 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,669 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,671 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,671 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,671 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,673 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,673 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,673 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,675 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,676 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,676 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,681 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,681 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,681 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,689 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,689 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:51:41,690 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:51:41,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,693 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 03:51:41,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,694 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:41,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,695 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,698 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:41,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,703 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,703 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:41,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,703 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,703 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,704 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:41,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,706 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,706 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,708 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:41,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,709 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,709 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,712 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,712 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:41,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,712 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,713 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,713 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,719 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:41,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,720 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,720 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,721 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,736 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:51:41,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,736 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,742 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 03:51:41,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,743 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,743 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,744 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,748 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,748 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,750 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,755 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,765 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,765 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,766 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:51:41,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,767 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,768 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,768 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,770 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,770 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,771 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,777 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,777 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,777 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,779 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:51:41,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,787 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,788 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,790 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:51:41,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,813 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,814 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:51:41,816 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:51:41,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,824 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 03:51:41,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,824 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,825 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,827 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,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-11-23 03:51:41,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,832 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,832 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,833 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,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-11-23 03:51:41,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,835 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,836 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,838 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,841 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,841 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,841 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,842 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,846 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,846 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,846 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,847 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:51:41,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,854 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:51:41,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:51:41,855 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:51:41,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,860 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 03:51:41,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-11-23 03:51:41,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,861 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,861 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:41,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,864 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,865 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,865 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:41,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,872 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,873 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:41,873 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:51:41,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,875 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,876 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:41,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,879 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,879 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:41,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,882 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,883 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,883 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:41,884 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:51:41,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,892 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:51:41,892 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:41,893 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:51:41,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:51:41,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:51:41,913 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:51:41,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:41,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:41,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:41,914 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:51:41,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:41,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:41,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:51:41,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:51:41,934 INFO L87 Difference]: Start difference. First operand 371 states and 537 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-23 03:51:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:51:42,440 INFO L93 Difference]: Finished difference Result 656 states and 915 transitions. [2018-11-23 03:51:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:51:42,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 915 transitions. [2018-11-23 03:51:42,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-23 03:51:42,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 915 transitions. [2018-11-23 03:51:42,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 656 [2018-11-23 03:51:42,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 656 [2018-11-23 03:51:42,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 915 transitions. [2018-11-23 03:51:42,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:51:42,451 INFO L705 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-23 03:51:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 915 transitions. [2018-11-23 03:51:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2018-11-23 03:51:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-23 03:51:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 915 transitions. [2018-11-23 03:51:42,464 INFO L728 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-23 03:51:42,464 INFO L608 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-23 03:51:42,464 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:51:42,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 656 states and 915 transitions. [2018-11-23 03:51:42,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-23 03:51:42,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:42,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:42,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:51:42,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:51:42,473 INFO L794 eck$LassoCheckResult]: Stem: 1788#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; 1664#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1665#L606-2 [2018-11-23 03:51:42,474 INFO L796 eck$LassoCheckResult]: Loop: 1665#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1769#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; 1770#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); 1916#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; 1678#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2173#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2171#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; 2169#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); 2167#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2165#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); 2163#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2161#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); 2159#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2157#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)); 2155#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); 2153#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); 2151#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); 2149#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2147#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); 2145#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2143#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2141#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2139#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); 2136#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); 2134#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2132#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); 2130#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2128#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2126#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); 2124#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2122#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); 2120#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); 2118#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2116#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2114#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2112#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2110#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); 2108#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2106#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2104#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2102#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); 2100#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2098#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2096#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); 2094#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2092#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); 2090#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); 2088#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2086#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); 2084#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2082#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2080#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)); 2078#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); 2077#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; 1809#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1665#L606-2 [2018-11-23 03:51:42,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 03:51:42,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:42,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:42,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:42,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:42,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:42,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-23 03:51:42,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:42,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:42,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:51:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:42,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:51:42,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:51:42,541 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:51:42,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:51:42,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:51:42,541 INFO L87 Difference]: Start difference. First operand 656 states and 915 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-23 03:51:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:51:43,172 INFO L93 Difference]: Finished difference Result 1220 states and 1693 transitions. [2018-11-23 03:51:43,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:51:43,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 1693 transitions. [2018-11-23 03:51:43,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1216 [2018-11-23 03:51:43,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1220 states and 1693 transitions. [2018-11-23 03:51:43,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1220 [2018-11-23 03:51:43,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1220 [2018-11-23 03:51:43,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1220 states and 1693 transitions. [2018-11-23 03:51:43,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:51:43,186 INFO L705 BuchiCegarLoop]: Abstraction has 1220 states and 1693 transitions. [2018-11-23 03:51:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states and 1693 transitions. [2018-11-23 03:51:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2018-11-23 03:51:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-11-23 03:51:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2018-11-23 03:51:43,203 INFO L728 BuchiCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-11-23 03:51:43,203 INFO L608 BuchiCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-11-23 03:51:43,203 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:51:43,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1217 states and 1687 transitions. [2018-11-23 03:51:43,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1213 [2018-11-23 03:51:43,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:43,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:43,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:51:43,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:51:43,210 INFO L794 eck$LassoCheckResult]: Stem: 3671#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; 3546#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3547#L606-2 [2018-11-23 03:51:43,210 INFO L796 eck$LassoCheckResult]: Loop: 3547#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4590#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; 4588#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); 4586#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4584#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); 4582#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4579#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); 4538#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; 3727#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4529#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4527#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; 4525#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; 3690#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4657#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4655#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; 4161#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); 4151#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4150#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); 4148#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4146#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); 4144#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4142#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)); 4140#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); 4138#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); 4136#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); 4134#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4132#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); 4130#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4128#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4126#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4124#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); 4122#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); 4120#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4118#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); 4116#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4114#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4112#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); 4110#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4108#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); 4106#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); 4104#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4102#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4100#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4098#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4096#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); 4094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4092#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4090#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4088#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); 4086#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4084#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4082#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); 4080#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4078#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); 4076#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); 4074#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4072#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); 4070#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4068#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4066#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)); 4064#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); 4061#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; 4062#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3547#L606-2 [2018-11-23 03:51:43,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:43,211 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 03:51:43,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:43,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:43,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:43,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:43,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:43,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-23 03:51:43,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:43,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:43,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:51:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:51:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:51:43,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:51:43,254 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:51:43,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:51:43,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:51:43,254 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-23 03:51:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:51:43,736 INFO L93 Difference]: Finished difference Result 1499 states and 1994 transitions. [2018-11-23 03:51:43,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:51:43,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1499 states and 1994 transitions. [2018-11-23 03:51:43,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1495 [2018-11-23 03:51:43,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1499 states to 1499 states and 1994 transitions. [2018-11-23 03:51:43,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1499 [2018-11-23 03:51:43,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1499 [2018-11-23 03:51:43,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1499 states and 1994 transitions. [2018-11-23 03:51:43,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:51:43,755 INFO L705 BuchiCegarLoop]: Abstraction has 1499 states and 1994 transitions. [2018-11-23 03:51:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states and 1994 transitions. [2018-11-23 03:51:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1498. [2018-11-23 03:51:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2018-11-23 03:51:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1992 transitions. [2018-11-23 03:51:43,774 INFO L728 BuchiCegarLoop]: Abstraction has 1498 states and 1992 transitions. [2018-11-23 03:51:43,774 INFO L608 BuchiCegarLoop]: Abstraction has 1498 states and 1992 transitions. [2018-11-23 03:51:43,774 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:51:43,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1498 states and 1992 transitions. [2018-11-23 03:51:43,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 03:51:43,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:43,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:43,780 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:51:43,780 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:51:43,781 INFO L794 eck$LassoCheckResult]: Stem: 6389#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; 6268#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6269#L606-2 [2018-11-23 03:51:43,781 INFO L796 eck$LassoCheckResult]: Loop: 6269#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7457#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; 7455#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); 7453#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7451#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); 7449#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7447#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); 7445#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7443#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)); 7441#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); 7439#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); 7437#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); 7435#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7433#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); 7431#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7429#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7428#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7427#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; 6502#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6891#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6889#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; 6887#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; 6408#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6893#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6892#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; 6890#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); 6888#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6886#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); 6884#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6882#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); 6880#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6878#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)); 6876#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); 6874#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); 6872#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); 6870#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6868#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); 6866#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6864#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6862#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6860#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); 6858#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); 6856#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6854#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); 6852#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6850#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6848#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); 6846#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6844#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); 6842#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); 6840#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6838#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6836#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6834#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6832#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); 6830#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6828#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6826#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6824#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); 6822#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6820#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6818#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); 6816#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6814#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); 6812#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); 6810#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6808#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); 6806#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6804#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6802#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)); 6800#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); 6796#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; 6797#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6269#L606-2 [2018-11-23 03:51:43,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:43,781 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-23 03:51:43,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:43,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:43,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:43,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:43,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:43,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-23 03:51:43,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:43,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:43,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:43,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:51:43,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:51:43,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:51:43,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:51:43,814 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:51:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:51:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:51:43,814 INFO L87 Difference]: Start difference. First operand 1498 states and 1992 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-11-23 03:51:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:51:44,253 INFO L93 Difference]: Finished difference Result 1497 states and 1812 transitions. [2018-11-23 03:51:44,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:51:44,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1497 states and 1812 transitions. [2018-11-23 03:51:44,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 03:51:44,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1497 states to 1497 states and 1812 transitions. [2018-11-23 03:51:44,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1497 [2018-11-23 03:51:44,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1497 [2018-11-23 03:51:44,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1497 states and 1812 transitions. [2018-11-23 03:51:44,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:51:44,269 INFO L705 BuchiCegarLoop]: Abstraction has 1497 states and 1812 transitions. [2018-11-23 03:51:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states and 1812 transitions. [2018-11-23 03:51:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2018-11-23 03:51:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-11-23 03:51:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1812 transitions. [2018-11-23 03:51:44,287 INFO L728 BuchiCegarLoop]: Abstraction has 1497 states and 1812 transitions. [2018-11-23 03:51:44,287 INFO L608 BuchiCegarLoop]: Abstraction has 1497 states and 1812 transitions. [2018-11-23 03:51:44,287 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:51:44,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1497 states and 1812 transitions. [2018-11-23 03:51:44,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 03:51:44,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:44,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:44,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:51:44,293 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:51:44,293 INFO L794 eck$LassoCheckResult]: Stem: 9394#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; 9269#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9270#L606-2 [2018-11-23 03:51:44,293 INFO L796 eck$LassoCheckResult]: Loop: 9270#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10068#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; 10067#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); 10066#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10065#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); 10063#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10061#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); 10053#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10054#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)); 10047#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); 10048#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); 10064#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); 10062#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10060#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); 10059#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10058#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10056#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9860#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); 9861#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); 10022#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10020#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); 10018#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10016#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10014#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); 10012#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10010#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); 10008#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); 10006#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9725#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; 9621#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9720#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9718#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; 9716#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); 9714#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9712#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); 9710#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9708#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); 9706#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9704#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)); 9702#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); 9700#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); 9698#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); 9696#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9694#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); 9692#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9690#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9688#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9686#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); 9684#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); 9682#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9680#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); 9678#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9676#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9674#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); 9672#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9670#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); 9668#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); 9666#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9664#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9662#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9660#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9658#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); 9656#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9654#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9652#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9650#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); 9648#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9646#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9644#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); 9642#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9640#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); 9638#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); 9636#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9634#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); 9632#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9630#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9628#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)); 9626#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); 9623#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; 9624#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9270#L606-2 [2018-11-23 03:51:44,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:44,294 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-23 03:51:44,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:44,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:44,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:44,298 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-23 03:51:44,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:44,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:44,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:51:44,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:44,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:51:44,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:51:44,377 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:51:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:51:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:51:44,377 INFO L87 Difference]: Start difference. First operand 1497 states and 1812 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-23 03:51:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:51:44,618 INFO L93 Difference]: Finished difference Result 1486 states and 1768 transitions. [2018-11-23 03:51:44,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:51:44,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1486 states and 1768 transitions. [2018-11-23 03:51:44,627 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-23 03:51:44,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1486 states to 1486 states and 1768 transitions. [2018-11-23 03:51:44,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1486 [2018-11-23 03:51:44,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1486 [2018-11-23 03:51:44,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1486 states and 1768 transitions. [2018-11-23 03:51:44,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:51:44,639 INFO L705 BuchiCegarLoop]: Abstraction has 1486 states and 1768 transitions. [2018-11-23 03:51:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states and 1768 transitions. [2018-11-23 03:51:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2018-11-23 03:51:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-11-23 03:51:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1768 transitions. [2018-11-23 03:51:44,660 INFO L728 BuchiCegarLoop]: Abstraction has 1486 states and 1768 transitions. [2018-11-23 03:51:44,660 INFO L608 BuchiCegarLoop]: Abstraction has 1486 states and 1768 transitions. [2018-11-23 03:51:44,660 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 03:51:44,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1486 states and 1768 transitions. [2018-11-23 03:51:44,665 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-23 03:51:44,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:44,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:44,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:51:44,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:51:44,671 INFO L794 eck$LassoCheckResult]: Stem: 12380#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; 12258#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12259#L606-2 [2018-11-23 03:51:44,672 INFO L796 eck$LassoCheckResult]: Loop: 12259#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13291#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; 13289#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); 13287#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13285#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); 13283#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13281#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); 13279#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13277#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)); 13275#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); 13273#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); 13271#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); 13269#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13267#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); 13265#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13263#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13261#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13259#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); 13257#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); 13255#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13253#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); 13251#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13249#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13247#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); 13245#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13244#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); 13242#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); 13240#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13238#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13236#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13234#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13232#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); 13230#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13228#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13226#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13224#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); 13222#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13220#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13218#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); 13216#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13214#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); 13212#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); 13210#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13208#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); 13206#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13204#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13203#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)); 13202#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); 13200#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); 13198#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13196#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); 12819#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 12820#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 12898#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); 12896#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); 12894#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 12892#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 12890#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); 12888#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 12886#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); 12884#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); 12882#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12880#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)); 12878#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 12876#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); 12874#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 12872#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)); 12870#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 12868#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 12866#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 12864#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)); 12862#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12860#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)); 12858#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 12856#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 12854#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12852#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); 12850#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12849#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12847#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12845#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12843#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12841#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12839#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12837#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12835#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12276#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12919#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12917#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12915#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12913#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12911#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12909#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12907#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12905#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12903#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12471#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13380#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13378#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13376#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13374#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13372#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13370#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13368#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13366#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13364#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13362#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13360#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13358#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13356#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13354#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13352#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13349#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13347#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13345#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13343#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13341#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13339#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13337#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13335#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13333#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13331#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13329#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13327#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13325#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13323#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13321#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13319#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13317#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13315#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13313#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13311#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13309#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13306#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13304#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13302#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13300#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13298#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13296#L594-1 calculate_output_#res := -2; 13294#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12259#L606-2 [2018-11-23 03:51:44,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-23 03:51:44,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:44,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:44,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:44,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:44,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-23 03:51:44,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:44,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:44,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:44,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:44,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:44,715 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-23 03:51:44,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:44,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:45,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:51:45,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 03:51:45,713 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-23 03:51:45,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:51:45,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:51:45,775 INFO L87 Difference]: Start difference. First operand 1486 states and 1768 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-23 03:51:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:51:46,583 INFO L93 Difference]: Finished difference Result 1676 states and 1955 transitions. [2018-11-23 03:51:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:51:46,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1676 states and 1955 transitions. [2018-11-23 03:51:46,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1621 [2018-11-23 03:51:46,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1676 states to 1676 states and 1955 transitions. [2018-11-23 03:51:46,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1676 [2018-11-23 03:51:46,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1676 [2018-11-23 03:51:46,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1676 states and 1955 transitions. [2018-11-23 03:51:46,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:51:46,596 INFO L705 BuchiCegarLoop]: Abstraction has 1676 states and 1955 transitions. [2018-11-23 03:51:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states and 1955 transitions. [2018-11-23 03:51:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1535. [2018-11-23 03:51:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-23 03:51:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1814 transitions. [2018-11-23 03:51:46,611 INFO L728 BuchiCegarLoop]: Abstraction has 1535 states and 1814 transitions. [2018-11-23 03:51:46,611 INFO L608 BuchiCegarLoop]: Abstraction has 1535 states and 1814 transitions. [2018-11-23 03:51:46,611 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 03:51:46,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1535 states and 1814 transitions. [2018-11-23 03:51:46,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1480 [2018-11-23 03:51:46,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:46,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:46,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:51:46,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:51:46,617 INFO L794 eck$LassoCheckResult]: Stem: 15562#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; 15445#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15446#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16661#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; 16659#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); 16657#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; 15702#L597 [2018-11-23 03:51:46,617 INFO L796 eck$LassoCheckResult]: Loop: 15702#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16956#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16954#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; 16952#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); 16951#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16950#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); 16949#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16947#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; 15702#L597 [2018-11-23 03:51:46,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-23 03:51:46,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:46,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:46,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:46,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:46,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-23 03:51:46,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:46,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:46,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:46,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:46,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:46,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-23 03:51:46,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:46,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:46,806 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:51:46,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:51:46,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:51:46,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:51:46,807 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:51:46,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:46,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:51:46,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:51:46,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label52_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-23 03:51:46,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:51:46,807 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:51:46,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:46,966 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:51:46,966 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:46,968 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:46,968 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:46,970 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:46,971 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:46,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:46,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:46,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:46,988 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,004 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,004 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,006 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,006 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,024 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,041 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,041 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,059 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,059 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,073 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,076 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,093 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,093 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,113 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,115 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,115 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,131 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,146 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,148 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,148 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,165 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,182 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,182 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,200 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,200 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,217 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,232 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:51:47,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,410 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,411 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,428 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,429 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,445 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:51:47,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,600 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,601 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,615 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,615 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,617 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,634 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,634 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_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:51:47,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:51:47,651 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:51:47,651 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [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; ----- [2018-11-23 03:51:47,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:51:47 BoogieIcfgContainer [2018-11-23 03:51:47,701 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:51:47,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:51:47,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:51:47,702 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:51:47,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:38" (3/4) ... [2018-11-23 03:51:47,708 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [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; ----- [2018-11-23 03:51:47,776 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b4af83c-e8f0-4116-b624-88115d7880a7/bin-2019/uautomizer/witness.graphml [2018-11-23 03:51:47,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:51:47,777 INFO L168 Benchmark]: Toolchain (without parser) took 10774.44 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 494.9 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 379.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:47,777 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:51:47,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.74 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 917.9 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:47,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:47,778 INFO L168 Benchmark]: Boogie Preprocessor took 42.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:47,778 INFO L168 Benchmark]: RCFGBuilder took 897.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:47,779 INFO L168 Benchmark]: BuchiAutomizer took 9318.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.8 MB). Peak memory consumption was 549.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:47,779 INFO L168 Benchmark]: Witness Printer took 74.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:47,781 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.74 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 917.9 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 897.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9318.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.8 MB). Peak memory consumption was 549.6 MB. Max. memory is 11.5 GB. * Witness Printer took 74.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 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 1535 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.0s. Construction of modules took 2.8s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 146 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1535 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1458 SDtfs, 2473 SDslu, 548 SDs, 0 SdLazy, 3949 SolverSat, 844 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 73ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@730c1e0a=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@693092a0=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@730c1e0a=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@693092a0=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@730c1e0a=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@693092a0=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 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [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; ----- 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...