./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 b5d27e813284518a11dcc3cc5ae3d66f549ea677 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-10-22 09:00:24,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:24,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:24,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:24,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:24,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:24,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:24,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:24,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:24,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:24,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:24,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:24,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:24,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:24,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:24,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:24,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:24,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:24,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:24,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:24,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:24,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:24,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:24,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:24,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:24,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:24,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:24,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:24,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:24,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:24,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:24,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:24,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:24,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:24,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:24,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:24,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:24,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:24,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:24,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:24,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:24,346 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:24,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:24,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:24,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:24,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:24,369 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:24,369 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:24,369 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:24,369 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:24,370 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:24,370 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:24,370 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:24,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:24,371 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:24,371 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:24,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:24,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:24,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:24,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:24,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:24,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:24,372 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:24,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:24,373 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:24,373 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:24,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:24,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:24,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:24,374 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:24,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:24,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:24,374 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:24,375 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:24,375 INFO L138 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 -> b5d27e813284518a11dcc3cc5ae3d66f549ea677 [2019-10-22 09:00:24,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:24,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:24,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:24,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:24,423 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:24,424 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2019-10-22 09:00:24,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/data/c45e035f7/50dec4b99d864822b8399b9880e4d087/FLAG19a9cea1a [2019-10-22 09:00:24,936 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:24,936 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2019-10-22 09:00:24,953 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/data/c45e035f7/50dec4b99d864822b8399b9880e4d087/FLAG19a9cea1a [2019-10-22 09:00:25,254 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/data/c45e035f7/50dec4b99d864822b8399b9880e4d087 [2019-10-22 09:00:25,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:25,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:25,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:25,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:25,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:25,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c87219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25, skipping insertion in model container [2019-10-22 09:00:25,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,272 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:25,321 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:25,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:25,828 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:25,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:25,922 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:25,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25 WrapperNode [2019-10-22 09:00:25,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:25,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:25,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:25,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:25,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:25,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:26,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:26,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:26,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:26,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:26,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:26,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:26,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:26,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:26,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:26,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:26,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... [2019-10-22 09:00:26,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:26,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:26,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:26,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:26,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:26,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:27,355 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:27,355 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:00:27,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:27 BoogieIcfgContainer [2019-10-22 09:00:27,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:27,357 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:27,357 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:27,361 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:27,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:27,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:25" (1/3) ... [2019-10-22 09:00:27,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fe6f1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:27, skipping insertion in model container [2019-10-22 09:00:27,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:27,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:25" (2/3) ... [2019-10-22 09:00:27,364 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fe6f1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:27, skipping insertion in model container [2019-10-22 09:00:27,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:27,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:27" (3/3) ... [2019-10-22 09:00:27,368 INFO L371 chiAutomizerObserver]: Analyzing ICFG Problem02_label16.c [2019-10-22 09:00:27,413 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:27,413 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:27,414 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:27,414 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:27,414 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:27,414 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:27,415 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:27,415 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:27,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-10-22 09:00:27,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-10-22 09:00:27,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:27,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:27,489 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:27,492 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:27,492 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:27,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-10-22 09:00:27,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-10-22 09:00:27,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:27,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:27,508 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:27,508 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:27,519 INFO L791 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 [2019-10-22 09:00:27,519 INFO L793 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 [2019-10-22 09:00:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,525 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:00:27,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045877043] [2019-10-22 09:00:27,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-10-22 09:00:27,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144973252] [2019-10-22 09:00:27,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:27,657 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-10-22 09:00:27,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:27,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257351957] [2019-10-22 09:00:27,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:27,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:27,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257351957] [2019-10-22 09:00:27,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:27,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:27,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79274068] [2019-10-22 09:00:27,888 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:27,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:27,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:27,889 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:27,889 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:27,889 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:27,889 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:27,890 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:27,890 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16.c_Iteration1_Loop [2019-10-22 09:00:27,890 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:27,890 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:27,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:27,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,221 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-10-22 09:00:28,288 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:28,289 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:28,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:28,297 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,306 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:28,306 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:28,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:28,319 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,329 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:28,329 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:28,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:28,337 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,351 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:28,351 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:28,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:28,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:28,370 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:28,370 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:28,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:28,384 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:28,389 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:28,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:28,423 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,427 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:28,427 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:28,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:28,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:28,445 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:28,445 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:28,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:28,453 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:28,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:28,469 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,486 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:28,488 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:28,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:28,488 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:28,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:28,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:28,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:28,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:28,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16.c_Iteration1_Loop [2019-10-22 09:00:28,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:28,489 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:28,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:28,786 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:28,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,798 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,813 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,813 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,825 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:28,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:28,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,893 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,894 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,904 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,904 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,904 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:28,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,907 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:28,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:28,908 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:28,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,922 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 09:00:28,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,927 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:28,928 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:28,928 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:28,945 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:28,945 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:28,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:28,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:28,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:28,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:28,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:28,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:28,949 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:28,949 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:28,955 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 09:00:28,961 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,005 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,006 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,006 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,006 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,021 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,021 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,031 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,032 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,032 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,036 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,036 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,038 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:29,038 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,047 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,054 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 09:00:29,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,056 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,057 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,075 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,075 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,085 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:29,085 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,087 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:29,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,121 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,122 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,123 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,131 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,131 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,132 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,132 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,135 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,136 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,136 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,136 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,140 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,140 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,140 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,140 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,143 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:29,143 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,144 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:29,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,149 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 09:00:29,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,150 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,151 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,152 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,152 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,159 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,159 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,160 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,160 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,164 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:29,164 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,166 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-10-22 09:00:29,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,185 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,186 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,191 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,191 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,195 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,196 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,199 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,199 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,200 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:29,201 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,202 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:29,202 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,203 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:29,203 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,208 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 09:00:29,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,209 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,209 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,210 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,216 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,216 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,237 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,237 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,238 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,239 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,239 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,242 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,243 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,243 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:29,243 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,245 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 09:00:29,246 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,283 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,283 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,284 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,284 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,285 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,290 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,290 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,291 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,291 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,291 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,292 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,295 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,295 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,295 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,296 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,296 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,296 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,300 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,300 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,300 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,301 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,301 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:29,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,303 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,303 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,303 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,304 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:29,304 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:29,305 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,305 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,311 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 09:00:29,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,312 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,312 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:29,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,312 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,314 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,314 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,329 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,330 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:29,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,330 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,331 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,331 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,336 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,336 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:29,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,336 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:29,336 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,340 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:29,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,431 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,431 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:29,431 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,431 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,432 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,432 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,438 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,438 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:29,438 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,439 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,439 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,439 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,443 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,443 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:29,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,444 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,444 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,448 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,449 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:29,449 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,449 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,450 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,452 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,452 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:29,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,452 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:29,453 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,454 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:29,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,461 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 09:00:29,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,462 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,463 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,463 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,463 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,466 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,466 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,478 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,479 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,479 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,479 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,480 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,486 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,486 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,487 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:29,487 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,492 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-10-22 09:00:29,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,624 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,624 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,625 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,626 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,634 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,634 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,634 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,635 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,641 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,641 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,641 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,641 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,642 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,647 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,648 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,648 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,649 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:29,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,651 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,651 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,651 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:29,651 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:29,653 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:29,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,664 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 09:00:29,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,665 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,665 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,666 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,667 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,667 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,676 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,676 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,677 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,677 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,680 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,680 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,681 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:29,681 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,682 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:29,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,741 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,741 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,741 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,741 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,741 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,742 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,742 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,744 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,748 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,748 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,749 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,749 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,764 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,765 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,765 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,765 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,765 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,766 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,769 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,769 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,769 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,770 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:29,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,775 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,775 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:29,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,776 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:29,776 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:29,777 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:29,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,786 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 09:00:29,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,787 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,787 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,788 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:29,789 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,924 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,924 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:29,925 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:29,925 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:29,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:29,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:29,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:29,934 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:29,934 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:29,935 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:29,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:29,935 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:29,935 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:29,938 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-10-22 09:00:29,942 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,107 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:30,107 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:30,107 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,108 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:30,109 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,119 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:30,119 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:30,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,119 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:30,120 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,124 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:30,124 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:30,124 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,125 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:30,125 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,129 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:30,129 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:30,129 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:30,131 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:30,131 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:30,131 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:30,136 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:30,136 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:30,136 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:30,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:30,136 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:30,137 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:30,138 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:30,139 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:30,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:30,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:30,165 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-10-22 09:00:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:30,933 INFO L93 Difference]: Finished difference Result 374 states and 489 transitions. [2019-10-22 09:00:30,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:30,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 489 transitions. [2019-10-22 09:00:30,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 305 [2019-10-22 09:00:30,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 307 states and 409 transitions. [2019-10-22 09:00:30,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2019-10-22 09:00:30,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2019-10-22 09:00:30,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 409 transitions. [2019-10-22 09:00:30,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:30,962 INFO L688 BuchiCegarLoop]: Abstraction has 307 states and 409 transitions. [2019-10-22 09:00:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 409 transitions. [2019-10-22 09:00:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-22 09:00:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-22 09:00:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-10-22 09:00:31,001 INFO L711 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-10-22 09:00:31,001 INFO L591 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-10-22 09:00:31,001 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:31,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-10-22 09:00:31,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-10-22 09:00:31,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:31,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:31,005 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:31,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:31,005 INFO L791 eck$LassoCheckResult]: Stem: 765#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; 630#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 631#L606-2 [2019-10-22 09:00:31,005 INFO L793 eck$LassoCheckResult]: Loop: 631#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 720#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; 756#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); 760#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 776#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); 712#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 713#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); 705#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 633#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; 634#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 631#L606-2 [2019-10-22 09:00:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 09:00:31,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991630590] [2019-10-22 09:00:31,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,017 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-10-22 09:00:31,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380030315] [2019-10-22 09:00:31,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:31,030 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-10-22 09:00:31,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:31,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469774143] [2019-10-22 09:00:31,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:31,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:31,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469774143] [2019-10-22 09:00:31,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:31,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:31,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599164637] [2019-10-22 09:00:31,158 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:31,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:31,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:31,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:31,158 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:31,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:31,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:31,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:31,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16.c_Iteration2_Loop [2019-10-22 09:00:31,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:31,159 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:31,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,336 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:31,337 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:31,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:31,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:31,345 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:31,345 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:31,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:31,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:31,353 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:31,353 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:31,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:31,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:31,360 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:31,360 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:31,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:31,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:31,367 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:31,368 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:31,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:31,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:31,383 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:31,383 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:31,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:31,394 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:31,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:31,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:31,415 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:31,416 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:31,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:31,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:31,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:31,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:31,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:31,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:31,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:31,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16.c_Iteration2_Loop [2019-10-22 09:00:31,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:31,417 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:31,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:31,650 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:31,650 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:31,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:31,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,654 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,658 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:31,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:31,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,665 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,665 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,668 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,668 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,672 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:31,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:31,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:31,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,677 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 09:00:31,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,678 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,679 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,681 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,682 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:31,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,684 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,684 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,686 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,687 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,689 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,689 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:31,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,693 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,693 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:31,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,699 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,699 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,700 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,711 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,711 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,713 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 09:00:31,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,717 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,717 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,718 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,720 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,720 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,720 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:31,720 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,722 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,722 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,722 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,725 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,725 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,726 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,726 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,726 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,729 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,730 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,730 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,730 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:31,730 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,734 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,734 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,735 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:31,739 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,746 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,747 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,751 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,751 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,752 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,752 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,754 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 09:00:31,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,755 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,756 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,759 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,759 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,760 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:31,760 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,763 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,763 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,767 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,768 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,772 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,772 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,773 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:31,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,779 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,779 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,780 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:31,787 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,794 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,799 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,799 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:31,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,805 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,805 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,805 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,807 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 09:00:31,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,808 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,809 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:31,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,810 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,810 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,814 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,814 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:31,815 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,815 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,815 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,815 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:31,816 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,817 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,817 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:31,818 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,818 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,818 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,820 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,820 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:31,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,821 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,821 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,823 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,824 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:31,824 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,824 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,824 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:31,825 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,830 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,830 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:31,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,831 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,831 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,832 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:31,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,840 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,840 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:31,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,840 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,841 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,841 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,850 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,850 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:31,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,850 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:31,851 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:31,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,853 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 09:00:31,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,854 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,854 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:31,854 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,855 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,855 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,855 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,859 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,860 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:31,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,860 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,860 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,861 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:31,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,863 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,863 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:31,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,863 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,864 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,866 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,867 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:31,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,867 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,868 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,868 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,871 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,873 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:31,873 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,873 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,873 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,875 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:31,875 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,881 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,882 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:31,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,882 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,882 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,884 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:31,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,901 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,901 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:31,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,902 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,903 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,912 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,913 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:31,913 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,913 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,913 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:31,914 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:31,914 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,919 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 09:00:31,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,920 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,921 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:31,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,921 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,922 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,936 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,936 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:31,936 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,936 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,936 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,937 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:31,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,939 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,939 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:31,939 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,940 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,940 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,941 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,942 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,942 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:31,942 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,943 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,944 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,950 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,950 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:31,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,951 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,951 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,953 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:31,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,963 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,963 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:31,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,964 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:31,964 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,967 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:31,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:31,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:31,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:31,991 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:31,991 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:31,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:31,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:31,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:31,991 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:31,994 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:31,999 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,010 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,010 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,011 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,011 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:32,012 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:32,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,019 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 09:00:32,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,020 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,020 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:32,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,021 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:32,021 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:32,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,024 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,024 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:32,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,025 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:32,025 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:32,025 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:32,025 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,028 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,028 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:32,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,028 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:32,028 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:32,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,031 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,031 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:32,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,032 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:32,032 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:32,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,035 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,035 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:32,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,035 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:32,035 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:32,036 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:32,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,043 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,043 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:32,043 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,044 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:32,044 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:32,045 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:32,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,054 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,054 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:32,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,054 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:32,055 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:32,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,065 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,065 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:32,065 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,065 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:32,066 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:32,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,069 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 09:00:32,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,070 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,070 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,071 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:32,071 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:32,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,075 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,075 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,075 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:32,075 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:32,076 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:32,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,079 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,079 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,080 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:32,081 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:32,085 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,088 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,088 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,088 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:32,089 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:32,089 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,093 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,093 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,094 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:32,094 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:32,095 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:32,095 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,115 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,115 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,115 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:32,116 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:32,117 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:32,122 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,181 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,181 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,182 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,182 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:32,183 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:32,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:32,216 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:32,216 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:32,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:32,216 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:32,216 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:32,217 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:32,217 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:32,217 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:32,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:32,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:32,228 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-10-22 09:00:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:32,692 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-10-22 09:00:32,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:32,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-10-22 09:00:32,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-10-22 09:00:32,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-10-22 09:00:32,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-10-22 09:00:32,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-10-22 09:00:32,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-10-22 09:00:32,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:32,706 INFO L688 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:00:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-10-22 09:00:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-22 09:00:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-22 09:00:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-10-22 09:00:32,734 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:00:32,734 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:00:32,735 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:32,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-10-22 09:00:32,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-10-22 09:00:32,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:32,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:32,739 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:32,739 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-10-22 09:00:32,739 INFO L791 eck$LassoCheckResult]: Stem: 1676#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; 1534#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1535#L606-2 [2019-10-22 09:00:32,740 INFO L793 eck$LassoCheckResult]: Loop: 1535#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2015#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; 2014#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); 2013#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; 1531#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1626#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1662#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); 1669#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1688#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;~a28~0 := 7;~a25~0 := 1;calculate_output_#res := 22; 1567#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1535#L606-2 [2019-10-22 09:00:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 09:00:32,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130594009] [2019-10-22 09:00:32,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,746 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1689438932, now seen corresponding path program 1 times [2019-10-22 09:00:32,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367589983] [2019-10-22 09:00:32,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:32,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367589983] [2019-10-22 09:00:32,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:32,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:32,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886222832] [2019-10-22 09:00:32,770 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:32,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:32,771 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 3 states. [2019-10-22 09:00:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:33,222 INFO L93 Difference]: Finished difference Result 1149 states and 1416 transitions. [2019-10-22 09:00:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:33,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1149 states and 1416 transitions. [2019-10-22 09:00:33,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-10-22 09:00:33,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-10-22 09:00:33,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1149 [2019-10-22 09:00:33,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1149 [2019-10-22 09:00:33,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1149 states and 1416 transitions. [2019-10-22 09:00:33,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:33,239 INFO L688 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:00:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states and 1416 transitions. [2019-10-22 09:00:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-10-22 09:00:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-10-22 09:00:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-10-22 09:00:33,263 INFO L711 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:00:33,263 INFO L591 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:00:33,263 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:33,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1416 transitions. [2019-10-22 09:00:33,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-10-22 09:00:33,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:33,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:33,271 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:33,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 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] [2019-10-22 09:00:33,271 INFO L791 eck$LassoCheckResult]: Stem: 3407#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; 3278#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3279#L606-2 [2019-10-22 09:00:33,272 INFO L793 eck$LassoCheckResult]: Loop: 3279#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3366#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; 3399#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); 3402#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; 3275#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3645#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3642#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; 3639#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); 3636#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3633#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); 3630#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3627#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); 3624#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3621#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)); 3618#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); 3615#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); 3612#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); 3609#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3606#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); 3602#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3599#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3596#L99 assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res := -1; 3560#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3644#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3641#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; 3638#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); 3635#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3632#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); 3629#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3626#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); 3623#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3620#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)); 3617#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); 3614#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); 3611#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); 3608#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3604#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); 3601#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3598#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3595#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3592#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); 3589#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); 3586#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3583#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); 3580#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3577#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3573#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); 3570#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3567#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); 3564#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;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 3421#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3279#L606-2 [2019-10-22 09:00:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,272 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-10-22 09:00:33,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245951158] [2019-10-22 09:00:33,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,279 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1352924138, now seen corresponding path program 1 times [2019-10-22 09:00:33,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216561167] [2019-10-22 09:00:33,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:33,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216561167] [2019-10-22 09:00:33,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:33,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:33,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137327378] [2019-10-22 09:00:33,316 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:33,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:33,317 INFO L87 Difference]: Start difference. First operand 1149 states and 1416 transitions. cyclomatic complexity: 268 Second operand 3 states. [2019-10-22 09:00:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:33,756 INFO L93 Difference]: Finished difference Result 1996 states and 2450 transitions. [2019-10-22 09:00:33,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:33,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1996 states and 2450 transitions. [2019-10-22 09:00:33,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1994 [2019-10-22 09:00:33,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1996 states to 1996 states and 2450 transitions. [2019-10-22 09:00:33,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1996 [2019-10-22 09:00:33,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1996 [2019-10-22 09:00:33,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1996 states and 2450 transitions. [2019-10-22 09:00:33,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:33,786 INFO L688 BuchiCegarLoop]: Abstraction has 1996 states and 2450 transitions. [2019-10-22 09:00:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states and 2450 transitions. [2019-10-22 09:00:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1710. [2019-10-22 09:00:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-10-22 09:00:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2146 transitions. [2019-10-22 09:00:33,814 INFO L711 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-10-22 09:00:33,814 INFO L591 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-10-22 09:00:33,814 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:33,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1710 states and 2146 transitions. [2019-10-22 09:00:33,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1708 [2019-10-22 09:00:33,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:33,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:33,825 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:33,825 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:33,826 INFO L791 eck$LassoCheckResult]: Stem: 6571#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; 6429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6430#L606-2 [2019-10-22 09:00:33,826 INFO L793 eck$LassoCheckResult]: Loop: 6430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6521#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; 6563#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); 6566#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6582#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); 6513#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6514#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); 6506#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; 6443#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6994#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6992#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; 6990#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); 6988#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6986#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); 6984#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6982#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); 6980#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6978#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)); 6976#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); 6974#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); 6972#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); 6970#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6968#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); 6966#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6964#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6962#L99 assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res := -1; 6879#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7193#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7188#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; 7183#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); 7178#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7173#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); 7168#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7164#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); 7160#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7155#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)); 7150#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); 7145#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); 7140#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); 7135#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7129#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); 7124#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7118#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7112#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7106#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); 7100#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); 6937#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6806#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); 6801#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6795#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6789#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); 6783#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6776#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); 6775#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;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 6587#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6430#L606-2 [2019-10-22 09:00:33,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-10-22 09:00:33,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689059911] [2019-10-22 09:00:33,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,832 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash -879392628, now seen corresponding path program 1 times [2019-10-22 09:00:33,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055490807] [2019-10-22 09:00:33,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 09:00:33,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055490807] [2019-10-22 09:00:33,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:33,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:33,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499620480] [2019-10-22 09:00:33,862 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:33,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:33,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:33,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:33,863 INFO L87 Difference]: Start difference. First operand 1710 states and 2146 transitions. cyclomatic complexity: 437 Second operand 3 states. [2019-10-22 09:00:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:34,273 INFO L93 Difference]: Finished difference Result 1709 states and 1964 transitions. [2019-10-22 09:00:34,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:34,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1709 states and 1964 transitions. [2019-10-22 09:00:34,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1707 [2019-10-22 09:00:34,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1709 states to 1709 states and 1964 transitions. [2019-10-22 09:00:34,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1709 [2019-10-22 09:00:34,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2019-10-22 09:00:34,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1709 states and 1964 transitions. [2019-10-22 09:00:34,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:34,295 INFO L688 BuchiCegarLoop]: Abstraction has 1709 states and 1964 transitions. [2019-10-22 09:00:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states and 1964 transitions. [2019-10-22 09:00:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1429. [2019-10-22 09:00:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-10-22 09:00:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1654 transitions. [2019-10-22 09:00:34,316 INFO L711 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-10-22 09:00:34,316 INFO L591 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-10-22 09:00:34,316 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:34,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1429 states and 1654 transitions. [2019-10-22 09:00:34,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1427 [2019-10-22 09:00:34,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:34,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:34,324 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:34,324 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 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] [2019-10-22 09:00:34,324 INFO L791 eck$LassoCheckResult]: Stem: 9998#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; 9854#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9855#L606-2 [2019-10-22 09:00:34,324 INFO L793 eck$LassoCheckResult]: Loop: 9855#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10437#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; 10431#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); 10415#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; 9851#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10406#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10404#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; 10402#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; 9925#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 11190#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9985#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; 9986#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); 11076#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11077#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); 9940#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9941#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); 9934#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9857#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)); 9858#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); 9859#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); 9860#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); 9960#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10012#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); 9961#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9879#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9880#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10001#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; 9932#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10320#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10318#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; 10316#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); 10314#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10261#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); 10257#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10252#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); 10247#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10242#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)); 10237#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); 10232#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); 10227#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); 10222#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10215#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); 10212#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10209#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10206#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10203#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); 10200#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); 10196#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10192#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); 10188#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10184#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10180#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); 10176#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10172#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); 10168#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;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 10134#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9855#L606-2 [2019-10-22 09:00:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-10-22 09:00:34,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467224227] [2019-10-22 09:00:34,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,330 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash 274284660, now seen corresponding path program 1 times [2019-10-22 09:00:34,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141755616] [2019-10-22 09:00:34,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-22 09:00:34,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141755616] [2019-10-22 09:00:34,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:34,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:34,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800706310] [2019-10-22 09:00:34,350 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:34,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:34,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:34,351 INFO L87 Difference]: Start difference. First operand 1429 states and 1654 transitions. cyclomatic complexity: 226 Second operand 3 states. [2019-10-22 09:00:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:34,794 INFO L93 Difference]: Finished difference Result 1851 states and 2102 transitions. [2019-10-22 09:00:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:34,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1851 states and 2102 transitions. [2019-10-22 09:00:34,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1846 [2019-10-22 09:00:34,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1851 states to 1851 states and 2102 transitions. [2019-10-22 09:00:34,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1851 [2019-10-22 09:00:34,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1851 [2019-10-22 09:00:34,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1851 states and 2102 transitions. [2019-10-22 09:00:34,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:34,816 INFO L688 BuchiCegarLoop]: Abstraction has 1851 states and 2102 transitions. [2019-10-22 09:00:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states and 2102 transitions. [2019-10-22 09:00:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1849. [2019-10-22 09:00:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-10-22 09:00:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2099 transitions. [2019-10-22 09:00:34,845 INFO L711 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-10-22 09:00:34,845 INFO L591 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-10-22 09:00:34,845 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:34,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1849 states and 2099 transitions. [2019-10-22 09:00:34,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1844 [2019-10-22 09:00:34,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:34,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:34,856 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:34,856 INFO L850 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] [2019-10-22 09:00:34,857 INFO L791 eck$LassoCheckResult]: Stem: 13279#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; 13140#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13141#L606-2 [2019-10-22 09:00:34,857 INFO L793 eck$LassoCheckResult]: Loop: 13141#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14669#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; 14667#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); 14665#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 14663#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); 14661#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 14659#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); 14614#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; 13154#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13488#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13486#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; 13484#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; 13337#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 14108#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14106#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; 14104#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); 14102#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 14099#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); 14100#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 14136#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); 14134#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 14132#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)); 13511#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); 13512#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); 14445#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); 14443#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 14020#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); 14019#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 14017#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 14015#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 14013#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); 14011#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); 14009#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 14007#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); 14005#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 14003#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 14001#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); 13999#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13997#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); 13995#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); 13993#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13991#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13989#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13987#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13985#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); 13977#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13973#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13969#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13965#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); 13961#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13957#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13953#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); 13949#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13945#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); 13941#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); 13937#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13933#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); 13929#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13764#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13765#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)); 13664#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); 13665#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; 13394#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13141#L606-2 [2019-10-22 09:00:34,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,857 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-10-22 09:00:34,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719707315] [2019-10-22 09:00:34,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,863 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-10-22 09:00:34,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211004579] [2019-10-22 09:00:34,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:34,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211004579] [2019-10-22 09:00:34,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:34,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:34,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116577589] [2019-10-22 09:00:34,900 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:34,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:34,901 INFO L87 Difference]: Start difference. First operand 1849 states and 2099 transitions. cyclomatic complexity: 252 Second operand 3 states. [2019-10-22 09:00:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:35,404 INFO L93 Difference]: Finished difference Result 1989 states and 2244 transitions. [2019-10-22 09:00:35,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:35,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1989 states and 2244 transitions. [2019-10-22 09:00:35,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-10-22 09:00:35,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-10-22 09:00:35,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1989 [2019-10-22 09:00:35,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1989 [2019-10-22 09:00:35,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1989 states and 2244 transitions. [2019-10-22 09:00:35,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:35,428 INFO L688 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:00:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states and 2244 transitions. [2019-10-22 09:00:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2019-10-22 09:00:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-10-22 09:00:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-10-22 09:00:35,455 INFO L711 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:00:35,455 INFO L591 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:00:35,455 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:35,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1989 states and 2244 transitions. [2019-10-22 09:00:35,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-10-22 09:00:35,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:35,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:35,465 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:35,467 INFO L850 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:35,467 INFO L791 eck$LassoCheckResult]: Stem: 17120#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; 16984#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 16985#L606-2 [2019-10-22 09:00:35,467 INFO L793 eck$LassoCheckResult]: Loop: 16985#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17073#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; 17110#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); 17114#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; 16983#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 18289#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 18287#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; 18285#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); 18283#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 18281#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); 18279#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 18277#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); 18275#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 18273#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)); 18271#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); 18269#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); 18267#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); 18265#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 18263#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); 18261#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 18259#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 18257#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 18255#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); 18253#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); 18251#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 18249#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); 18247#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 18245#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 18243#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); 18241#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 18239#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); 18237#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); 18235#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 18233#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 18220#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 18221#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 18497#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); 18493#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 18488#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 18482#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 17321#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); 17322#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 18494#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 18489#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); 18483#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 17323#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); 17324#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); 18333#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 18331#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); 18329#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 18327#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 18325#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)); 18323#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); 18321#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); 18319#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 18317#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); 18315#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 18313#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 18292#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); 18293#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); 18463#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 18462#L293 assume (1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0;~a28~0 := 7;~a25~0 := 1;calculate_output_#res := -1; 17133#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16985#L606-2 [2019-10-22 09:00:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,468 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2019-10-22 09:00:35,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928243631] [2019-10-22 09:00:35,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,480 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1740840234, now seen corresponding path program 1 times [2019-10-22 09:00:35,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865352680] [2019-10-22 09:00:35,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:35,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865352680] [2019-10-22 09:00:35,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:35,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:35,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738014672] [2019-10-22 09:00:35,541 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:35,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:35,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:35,543 INFO L87 Difference]: Start difference. First operand 1989 states and 2244 transitions. cyclomatic complexity: 257 Second operand 4 states. [2019-10-22 09:00:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:36,253 INFO L93 Difference]: Finished difference Result 2552 states and 2753 transitions. [2019-10-22 09:00:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:36,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2552 states and 2753 transitions. [2019-10-22 09:00:36,267 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2546 [2019-10-22 09:00:36,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2552 states to 2552 states and 2753 transitions. [2019-10-22 09:00:36,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2552 [2019-10-22 09:00:36,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2552 [2019-10-22 09:00:36,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2552 states and 2753 transitions. [2019-10-22 09:00:36,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:36,283 INFO L688 BuchiCegarLoop]: Abstraction has 2552 states and 2753 transitions. [2019-10-22 09:00:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states and 2753 transitions. [2019-10-22 09:00:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2130. [2019-10-22 09:00:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-10-22 09:00:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2325 transitions. [2019-10-22 09:00:36,314 INFO L711 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-10-22 09:00:36,314 INFO L591 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-10-22 09:00:36,314 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:36,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2130 states and 2325 transitions. [2019-10-22 09:00:36,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2124 [2019-10-22 09:00:36,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:36,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:36,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:36,324 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 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, 1] [2019-10-22 09:00:36,324 INFO L791 eck$LassoCheckResult]: Stem: 21661#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; 21532#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 21533#L606-2 [2019-10-22 09:00:36,324 INFO L793 eck$LassoCheckResult]: Loop: 21533#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 23339#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; 23336#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); 23333#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 23330#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); 23327#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 23324#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); 22297#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 22298#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)); 23465#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); 23463#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); 23461#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); 23459#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 23457#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); 23455#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 23453#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 23451#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 23449#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); 23447#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); 23445#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 23443#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); 23441#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 23438#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 23435#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); 23432#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 23429#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); 23427#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); 23425#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 23423#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; 21546#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 21839#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 21837#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; 21834#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; 21835#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 22351#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 22349#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; 22347#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); 22345#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 22343#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); 22341#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 22339#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); 22337#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 22335#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)); 22333#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); 22331#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); 22329#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); 22327#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 22325#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); 22323#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 22321#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 22319#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 22317#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); 22315#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); 22313#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 22311#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); 22309#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 22307#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 22134#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); 22135#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 22949#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); 22944#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); 22361#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 22362#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 22922#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 22916#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 22910#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); 22904#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 22898#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 22892#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 22886#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); 22576#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 22577#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 22583#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); 22566#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 22561#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); 22359#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); 22360#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 22663#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); 22661#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 22659#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 22657#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)); 22655#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); 22653#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; 22024#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 21533#L606-2 [2019-10-22 09:00:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2019-10-22 09:00:36,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193079063] [2019-10-22 09:00:36,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,330 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1701192337, now seen corresponding path program 1 times [2019-10-22 09:00:36,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574369112] [2019-10-22 09:00:36,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:36,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574369112] [2019-10-22 09:00:36,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:36,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:36,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760673149] [2019-10-22 09:00:36,393 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:36,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:36,393 INFO L87 Difference]: Start difference. First operand 2130 states and 2325 transitions. cyclomatic complexity: 198 Second operand 3 states. [2019-10-22 09:00:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:36,607 INFO L93 Difference]: Finished difference Result 1838 states and 1967 transitions. [2019-10-22 09:00:36,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:36,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1838 states and 1967 transitions. [2019-10-22 09:00:36,614 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1833 [2019-10-22 09:00:36,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1838 states to 1838 states and 1967 transitions. [2019-10-22 09:00:36,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1838 [2019-10-22 09:00:36,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1838 [2019-10-22 09:00:36,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1838 states and 1967 transitions. [2019-10-22 09:00:36,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:36,626 INFO L688 BuchiCegarLoop]: Abstraction has 1838 states and 1967 transitions. [2019-10-22 09:00:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states and 1967 transitions. [2019-10-22 09:00:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1278. [2019-10-22 09:00:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-10-22 09:00:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1407 transitions. [2019-10-22 09:00:36,647 INFO L711 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-10-22 09:00:36,647 INFO L591 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-10-22 09:00:36,647 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:36,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1278 states and 1407 transitions. [2019-10-22 09:00:36,650 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1273 [2019-10-22 09:00:36,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:36,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:36,652 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:36,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 09:00:36,653 INFO L791 eck$LassoCheckResult]: Stem: 25622#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; 25503#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 25504#L606-2 [2019-10-22 09:00:36,654 INFO L793 eck$LassoCheckResult]: Loop: 25504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 26311#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; 26309#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); 26307#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 26305#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); 26303#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 26301#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); 26299#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 26297#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)); 26295#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); 26293#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); 26289#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); 26290#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 26284#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); 26280#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 26281#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 26272#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 26273#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); 26264#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); 26265#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 26256#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); 26257#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 26248#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 26249#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); 26236#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 26237#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); 26224#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); 26225#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 25818#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; 25635#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 25813#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 25810#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; 25807#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); 25803#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 25799#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); 25795#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 25791#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); 25785#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 25780#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)); 25774#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); 25768#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); 25763#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); 25758#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 25753#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); 25748#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 25743#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 25738#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 25732#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); 25727#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); 25722#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 25717#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); 25712#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 25707#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 25702#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); 25697#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 25693#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); 25688#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); 25684#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 25680#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 25676#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 25671#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 25672#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); 25821#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 25822#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 25914#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 25909#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); 25904#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 25899#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 25894#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); 25890#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 25886#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); 25882#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); 25878#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 25874#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); 25870#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 25866#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 25862#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)); 25858#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); 25854#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); 25850#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 25846#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); 25842#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 25838#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 25834#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); 25830#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); 25825#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 25826#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 26132#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); 26129#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 26126#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); 26123#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); 26120#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 26117#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)); 26114#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 26111#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); 26108#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 26105#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)); 26102#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 26099#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 26096#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 26093#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)); 26090#L394 assume ((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a19~0 := 0;~a28~0 := 7;calculate_output_#res := 25; 25566#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 26313#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 26312#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; 26310#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); 26308#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 26306#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); 26304#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 26302#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); 26300#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 26298#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)); 26296#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); 26294#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); 26292#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); 26287#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 26288#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); 26291#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 26276#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 26277#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 26268#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); 26269#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); 26260#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 26261#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); 26252#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 26253#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 26242#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); 26243#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 26230#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); 26231#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;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 25772#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 25504#L606-2 [2019-10-22 09:00:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2019-10-22 09:00:36,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94473026] [2019-10-22 09:00:36,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,659 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -645173945, now seen corresponding path program 1 times [2019-10-22 09:00:36,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117568674] [2019-10-22 09:00:36,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:36,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117568674] [2019-10-22 09:00:36,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:36,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:36,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030155710] [2019-10-22 09:00:36,721 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:36,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:36,722 INFO L87 Difference]: Start difference. First operand 1278 states and 1407 transitions. cyclomatic complexity: 133 Second operand 3 states. [2019-10-22 09:00:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:37,100 INFO L93 Difference]: Finished difference Result 1841 states and 1970 transitions. [2019-10-22 09:00:37,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:37,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1841 states and 1970 transitions. [2019-10-22 09:00:37,104 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1835 [2019-10-22 09:00:37,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1841 states to 1841 states and 1970 transitions. [2019-10-22 09:00:37,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1841 [2019-10-22 09:00:37,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1841 [2019-10-22 09:00:37,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 1970 transitions. [2019-10-22 09:00:37,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:37,115 INFO L688 BuchiCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2019-10-22 09:00:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 1970 transitions. [2019-10-22 09:00:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1418. [2019-10-22 09:00:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-10-22 09:00:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1541 transitions. [2019-10-22 09:00:37,135 INFO L711 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-10-22 09:00:37,135 INFO L591 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-10-22 09:00:37,135 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:37,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1418 states and 1541 transitions. [2019-10-22 09:00:37,139 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1412 [2019-10-22 09:00:37,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:37,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:37,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:37,140 INFO L850 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] [2019-10-22 09:00:37,140 INFO L791 eck$LassoCheckResult]: Stem: 28746#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; 28628#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 28629#L606-2 [2019-10-22 09:00:37,141 INFO L793 eck$LassoCheckResult]: Loop: 28629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 29450#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; 29447#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); 29444#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 29441#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); 29438#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 29435#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); 29432#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 29429#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)); 29426#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); 29423#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); 29415#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); 29416#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 29407#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); 29408#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 29399#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 29400#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 29391#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); 29392#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); 29383#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 29384#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); 29375#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 29376#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 29367#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); 29368#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29355#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); 29356#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); 29343#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 29344#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 29413#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 29414#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 29405#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); 29406#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 29397#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 29398#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 29389#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); 29390#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 29381#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 29382#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); 29373#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 29374#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); 29363#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); 29364#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 29351#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); 29352#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 29245#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 29246#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)); 29359#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); 29360#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); 29347#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 29348#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); 28916#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 28917#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 29711#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); 29708#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); 29705#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 29702#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 29699#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); 29696#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 29693#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); 29690#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); 29687#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 29684#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)); 29681#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 29678#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); 29675#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 29672#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)); 29669#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 29666#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 29663#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 29660#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)); 29657#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29654#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)); 29651#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 29648#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 29645#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 29642#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); 29639#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29636#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29633#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29630#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29627#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29624#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29621#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29618#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29615#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29612#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29609#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29606#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29603#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29600#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29597#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29594#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29591#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29588#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29585#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29582#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29579#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29576#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29573#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29570#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29567#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29564#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29561#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29558#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29555#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29552#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29549#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29546#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29543#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29540#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29537#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29534#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29531#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29528#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29525#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29522#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29519#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29516#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29513#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29510#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29507#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29504#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29501#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29498#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29495#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29492#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29489#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29486#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29483#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29480#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29477#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29474#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29471#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29468#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29465#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29462#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29459#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29456#L594-1 calculate_output_#res := -2; 29454#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 28629#L606-2 [2019-10-22 09:00:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2019-10-22 09:00:37,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644223174] [2019-10-22 09:00:37,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,146 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-10-22 09:00:37,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388173991] [2019-10-22 09:00:37,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,183 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,184 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-10-22 09:00:37,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135744424] [2019-10-22 09:00:37,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:37,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135744424] [2019-10-22 09:00:37,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:37,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 09:00:37,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070989357] [2019-10-22 09:00:38,423 WARN L191 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-10-22 09:00:38,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:00:38,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:00:38,512 INFO L87 Difference]: Start difference. First operand 1418 states and 1541 transitions. cyclomatic complexity: 128 Second operand 9 states. [2019-10-22 09:00:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:39,042 INFO L93 Difference]: Finished difference Result 1330 states and 1452 transitions. [2019-10-22 09:00:39,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:39,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 1452 transitions. [2019-10-22 09:00:39,045 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-10-22 09:00:39,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-10-22 09:00:39,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2019-10-22 09:00:39,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2019-10-22 09:00:39,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 1452 transitions. [2019-10-22 09:00:39,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:39,052 INFO L688 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:00:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 1452 transitions. [2019-10-22 09:00:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2019-10-22 09:00:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-22 09:00:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-10-22 09:00:39,069 INFO L711 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:00:39,069 INFO L591 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:00:39,069 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:00:39,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1452 transitions. [2019-10-22 09:00:39,072 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-10-22 09:00:39,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:39,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:39,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:39,073 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:39,073 INFO L791 eck$LassoCheckResult]: Stem: 31519#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; 31398#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 31399#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 32229#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; 32226#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); 32223#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; 31441#L597 [2019-10-22 09:00:39,073 INFO L793 eck$LassoCheckResult]: Loop: 31441#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 32483#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 32480#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; 32476#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); 32472#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 32468#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); 32464#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 32457#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; 31441#L597 [2019-10-22 09:00:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-10-22 09:00:39,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:39,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247473962] [2019-10-22 09:00:39,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,080 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-10-22 09:00:39,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:39,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091738136] [2019-10-22 09:00:39,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,087 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-10-22 09:00:39,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:39,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906528849] [2019-10-22 09:00:39,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,095 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:39,271 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-10-22 09:00:39,313 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:39,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:39,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:39,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:39,313 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:39,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:39,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:39,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16.c_Iteration12_Lasso [2019-10-22 09:00:39,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:39,314 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:39,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00: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 [2019-10-22 09:00:39,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00: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 [2019-10-22 09:00:39,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,589 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:39,589 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:39,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:39,599 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,599 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,607 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,611 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,620 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,624 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:39,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:39,636 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,636 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,649 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,652 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,652 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,660 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,664 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,664 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,674 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,678 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,678 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,692 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,696 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,696 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,706 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,710 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,710 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,716 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,719 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,720 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,728 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,731 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,732 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,738 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,742 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,742 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,748 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,752 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:39,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:39,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,764 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,770 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,774 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,774 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,780 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:39,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:39,796 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:40,018 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:40,018 INFO L440 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=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, 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=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 15, 13] Nus: [0, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:40,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:40,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:40,026 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:40,026 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:40,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:40,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:40,032 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:40,032 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:40,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:40,036 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:40,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:40,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:40,152 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:40,152 INFO L440 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=18}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=28}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:40,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:40,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:40,166 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:40,166 INFO L440 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_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/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 [2019-10-22 09:00:40,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:40,171 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:40,174 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:40,174 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-10-22 09:00:40,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:40 BoogieIcfgContainer [2019-10-22 09:00:40,200 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:40,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:40,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:40,201 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:40,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:27" (3/4) ... [2019-10-22 09:00:40,204 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:00:40,253 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4e68fcec-1171-429e-b58d-e61472f9ec13/bin/uautomizer/witness.graphml [2019-10-22 09:00:40,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:40,256 INFO L168 Benchmark]: Toolchain (without parser) took 14998.51 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 452.5 MB). Free memory was 945.9 MB in the beginning and 937.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 460.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:40,256 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:40,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:40,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.08 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:40,257 INFO L168 Benchmark]: Boogie Preprocessor took 57.84 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:40,258 INFO L168 Benchmark]: RCFGBuilder took 1294.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:40,258 INFO L168 Benchmark]: BuchiAutomizer took 12843.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 996.6 MB in the beginning and 941.4 MB in the end (delta: 55.2 MB). Peak memory consumption was 373.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:40,259 INFO L168 Benchmark]: Witness Printer took 54.11 ms. Allocated memory is still 1.5 GB. Free memory was 941.4 MB in the beginning and 937.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:40,266 INFO L335 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 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 663.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.08 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.84 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1294.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12843.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 996.6 MB in the beginning and 941.4 MB in the end (delta: 55.2 MB). Peak memory consumption was 373.5 MB. Max. memory is 11.5 GB. * Witness Printer took 54.11 ms. Allocated memory is still 1.5 GB. Free memory was 941.4 MB in the beginning and 937.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 1330 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.7s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 6.7s. Construction of modules took 3.7s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1975 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2130 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1503 SDtfs, 1791 SDslu, 175 SDs, 0 SdLazy, 4260 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 172ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - 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@333d4539=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d97c822=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@333d4539=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d97c822=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@333d4539=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@2d97c822=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 -5*0^k, output=-1 + sum_{k=0}^i 18*0^k + -23*0^k + -23*k*0^(k-1) + 28*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i -5*0^k, input=6 + sum_{k=0}^i -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 4GEVs Lambdas: [0, 15, 13, 0, 0, 0] Mus: [0, 1, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...