./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label37.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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label37.c -s /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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 a2597194a43836f4c4ad9c950ead0db96723770b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:01:18,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:18,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:18,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:18,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:18,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:18,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:18,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:18,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:18,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:18,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:18,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:18,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:18,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:18,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:18,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:18,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:18,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:18,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:18,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:18,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:18,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:18,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:18,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:18,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:18,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:18,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:18,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:18,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:18,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:18,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:18,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:18,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:18,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:18,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:18,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:18,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:18,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:18,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:18,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:18,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:18,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:01:18,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:18,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:18,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:18,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:18,647 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:18,647 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:18,648 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:18,648 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:18,648 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:18,648 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:18,648 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:18,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:18,649 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:18,649 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:18,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:18,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:18,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:18,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:18,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:18,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:18,650 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:18,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:18,650 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:18,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:18,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:18,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:18,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:18,651 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:18,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:18,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:18,652 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:18,657 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:18,658 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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 -> a2597194a43836f4c4ad9c950ead0db96723770b [2019-10-22 09:01:18,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:18,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:18,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:18,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:18,719 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:18,719 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label37.c [2019-10-22 09:01:18,776 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/data/3d9e8145f/fd1c8ed3ab2c490aa5366bf745fb6e94/FLAGf15f40cf6 [2019-10-22 09:01:19,293 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:19,294 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/sv-benchmarks/c/eca-rers2012/Problem02_label37.c [2019-10-22 09:01:19,313 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/data/3d9e8145f/fd1c8ed3ab2c490aa5366bf745fb6e94/FLAGf15f40cf6 [2019-10-22 09:01:19,744 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/data/3d9e8145f/fd1c8ed3ab2c490aa5366bf745fb6e94 [2019-10-22 09:01:19,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:19,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:19,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:19,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:19,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:19,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76848e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19, skipping insertion in model container [2019-10-22 09:01:19,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,766 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:19,811 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:20,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:20,236 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:20,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:20,380 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:20,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20 WrapperNode [2019-10-22 09:01:20,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:20,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:20,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:20,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:20,393 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:01:20" (1/1) ... [2019-10-22 09:01:20,421 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:01:20" (1/1) ... [2019-10-22 09:01:20,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:20,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:20,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:20,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:20,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:20,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:20,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:20,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:20,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:20,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:20,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:21,877 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:21,878 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:21,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:21 BoogieIcfgContainer [2019-10-22 09:01:21,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:21,880 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:21,880 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:21,883 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:21,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:21,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:19" (1/3) ... [2019-10-22 09:01:21,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61a8e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:21, skipping insertion in model container [2019-10-22 09:01:21,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:21,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20" (2/3) ... [2019-10-22 09:01:21,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61a8e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:21, skipping insertion in model container [2019-10-22 09:01:21,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:21,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:21" (3/3) ... [2019-10-22 09:01:21,888 INFO L371 chiAutomizerObserver]: Analyzing ICFG Problem02_label37.c [2019-10-22 09:01:21,929 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:21,929 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:21,929 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:21,930 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:21,930 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:21,930 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:21,930 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:21,930 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:21,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-10-22 09:01:21,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-10-22 09:01:21,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:21,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:21,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:21,989 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:21,989 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:21,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-10-22 09:01:21,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-10-22 09:01:21,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:21,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:21,998 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:21,998 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:22,004 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:01:22,005 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:01:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:01:22,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956285875] [2019-10-22 09:01:22,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,115 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:22,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-10-22 09:01:22,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902326115] [2019-10-22 09:01:22,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:22,143 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:22,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-10-22 09:01:22,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277872690] [2019-10-22 09:01:22,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:22,209 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:01:22,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277872690] [2019-10-22 09:01:22,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:22,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:22,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200329383] [2019-10-22 09:01:22,366 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:22,366 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:22,366 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:22,367 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:22,367 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:22,367 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,367 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:22,367 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:22,367 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37.c_Iteration1_Loop [2019-10-22 09:01:22,368 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:22,368 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:22,392 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:01:22,401 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:01:22,437 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:01:22,447 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:01:22,453 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:01:22,457 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:01:22,463 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:01:22,473 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:01:22,702 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-10-22 09:01:22,757 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:22,757 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:22,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:22,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:22,768 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:22,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:22,785 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:22,785 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:22,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:22,797 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:01:22,804 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:22,805 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:22,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:22,813 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,821 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:22,821 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:22,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:22,871 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:22,872 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:22,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:22,882 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:22,882 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:22,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:22,889 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,896 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:22,896 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:22,905 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:22,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:22,936 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:22,939 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:22,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:22,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:22,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:22,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:22,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:22,940 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:22,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:22,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37.c_Iteration1_Loop [2019-10-22 09:01:22,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:22,940 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:22,948 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:01:22,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:01:22,967 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:01:23,009 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:01:23,018 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:01:23,021 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:01:23,027 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:01:23,030 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:01:23,253 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:23,260 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:23,262 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:01:23,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:23,276 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:23,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,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:01:23,304 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,304 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,305 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:23,305 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:23,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,317 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:01:23,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,319 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:23,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:23,321 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:23,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,365 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:01:23,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:23,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:23,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,382 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:01:23,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:23,384 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:23,384 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,386 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:01:23,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,387 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:23,388 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:23,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,397 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:01:23,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:23,398 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:23,398 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,399 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:01:23,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,400 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,400 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:23,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:23,402 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,407 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 09:01:23,407 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:01:23,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,412 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,413 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,426 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:01:23,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,428 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,428 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,431 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:01:23,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,431 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,432 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:23,432 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,436 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 09:01:23,439 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,481 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:01:23,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,484 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,484 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,485 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,490 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,499 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:01:23,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,500 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,500 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,500 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,503 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:01:23,503 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,503 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,504 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,504 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,504 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,515 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:01:23,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,515 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,516 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,516 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,525 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:01:23,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,526 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:23,526 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:23,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,532 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 09:01:23,532 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:01:23,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,539 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,540 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,553 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:01:23,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,554 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,554 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,554 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,555 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,555 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,558 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:01:23,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,558 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,558 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:23,559 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,560 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:23,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,578 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:01:23,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,578 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,579 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,579 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,583 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:01:23,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,584 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,585 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,587 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:01:23,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,588 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,589 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,592 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:01:23,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,593 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,593 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,593 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,594 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:01:23,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,595 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,595 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:23,595 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,596 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:23,596 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,602 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 09:01:23,602 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:01:23,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,603 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,603 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,603 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,604 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:23,604 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,611 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:01:23,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,611 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,612 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,612 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:23,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,615 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:01:23,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,616 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:23,616 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,619 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-10-22 09:01:23,619 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,644 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:01:23,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,645 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,646 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:23,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,655 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:01:23,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,656 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,656 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:23,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,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:01:23,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,660 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,660 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:23,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,668 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:01:23,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,669 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,670 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,671 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:23,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,672 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:01:23,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:23,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,673 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:23,673 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,674 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:01:23,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,684 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 09:01:23,684 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:01:23,685 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,685 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:23,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,685 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,687 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,711 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:01:23,711 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,711 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:23,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,712 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,713 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,716 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:01:23,723 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,723 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:23,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,723 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:23,723 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,726 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 09:01:23,726 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,776 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:01:23,777 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,777 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:23,780 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,781 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,782 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,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:01:23,788 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,788 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:23,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,789 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,790 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,792 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:01:23,793 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,793 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:23,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,794 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,794 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,794 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,797 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:01:23,798 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,798 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:23,798 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,798 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,799 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:23,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,800 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:01:23,800 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,800 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:23,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,801 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:23,801 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:23,802 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:23,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,808 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 09:01:23,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:01:23,809 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,809 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:23,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,810 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,811 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,812 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,838 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:01:23,839 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,839 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:23,839 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,839 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,840 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,841 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,845 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:01:23,846 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,846 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:23,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,846 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:23,847 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,850 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:23,850 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,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:01:23,934 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,934 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:23,934 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,934 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,936 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,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:01:23,942 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,942 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:23,942 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,943 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,943 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,943 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,947 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:01:23,948 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,948 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:23,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,948 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,949 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,953 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:01:23,954 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,954 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:23,954 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,954 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,955 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:23,955 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,956 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:01:23,957 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,958 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:23,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,958 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:23,958 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:23,959 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:23,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,968 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 09:01:23,968 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:01:23,969 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,969 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:23,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,970 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,973 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:23,973 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,986 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:01:23,987 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,987 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:23,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:23,988 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:23,989 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:23,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:23,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:23,994 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:01:23,995 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:23,995 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:23,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:23,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:23,995 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:23,995 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:24,001 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-10-22 09:01:24,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,165 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:01:24,166 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,166 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,166 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,167 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:24,169 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:24,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,176 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:01:24,177 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,177 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,177 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,177 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:24,178 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:24,179 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,183 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:01:24,184 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,184 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,184 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:24,186 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:24,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,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:01:24,191 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,191 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,192 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:24,192 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:24,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,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:01:24,194 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,194 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,194 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,195 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:24,195 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:24,197 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:01:24,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,209 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 09:01:24,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:01:24,210 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,210 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:24,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,210 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:24,211 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:24,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,223 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:01:24,223 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,223 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:24,223 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,224 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:24,224 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:24,224 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,227 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:01:24,227 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,227 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:24,227 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,228 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:24,228 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:24,230 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:24,230 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,264 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:01:24,266 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,266 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:24,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,267 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:24,267 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:24,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,272 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:01:24,272 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,272 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:24,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,275 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:24,276 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:24,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,281 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:01:24,282 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,282 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:24,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,282 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:24,283 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:24,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,286 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:01:24,287 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,287 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:24,287 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,288 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:24,288 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:24,288 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,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:01:24,291 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,291 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:24,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,291 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,291 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:24,291 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:24,292 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:24,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,300 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 09:01:24,301 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:01:24,301 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,301 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,302 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:24,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:24,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,456 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:01:24,457 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,457 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,458 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,458 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:24,458 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:24,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,463 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:01:24,464 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,464 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,464 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,465 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:01:24,465 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:24,468 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-10-22 09:01:24,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,622 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:01:24,622 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,623 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,623 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,623 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:24,624 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:24,624 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,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:01:24,633 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,633 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,634 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:24,634 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:24,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,638 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:01:24,638 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,639 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,639 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:24,640 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:24,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,643 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:01:24,644 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,644 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:24,644 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:24,645 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:24,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,648 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:01:24,648 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:24,648 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:24,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:24,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:24,649 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:24,649 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:24,650 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:24,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:24,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:24,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,680 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-10-22 09:01:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,446 INFO L93 Difference]: Finished difference Result 374 states and 489 transitions. [2019-10-22 09:01:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 489 transitions. [2019-10-22 09:01:25,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 305 [2019-10-22 09:01:25,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 307 states and 409 transitions. [2019-10-22 09:01:25,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2019-10-22 09:01:25,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2019-10-22 09:01:25,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 409 transitions. [2019-10-22 09:01:25,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:25,473 INFO L688 BuchiCegarLoop]: Abstraction has 307 states and 409 transitions. [2019-10-22 09:01:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 409 transitions. [2019-10-22 09:01:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-22 09:01:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-22 09:01:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-10-22 09:01:25,546 INFO L711 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-10-22 09:01:25,546 INFO L591 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-10-22 09:01:25,546 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:25,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-10-22 09:01:25,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-10-22 09:01:25,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:25,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:25,557 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:25,557 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:25,558 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:01:25,558 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:01:25,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 09:01:25,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831812419] [2019-10-22 09:01:25,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:25,566 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-10-22 09:01:25,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325952806] [2019-10-22 09:01:25,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:25,579 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-10-22 09:01:25,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215384714] [2019-10-22 09:01:25,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,602 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:01:25,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215384714] [2019-10-22 09:01:25,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:25,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152662544] [2019-10-22 09:01:25,726 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:25,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:25,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:25,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:25,726 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:25,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:25,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:25,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:25,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37.c_Iteration2_Loop [2019-10-22 09:01:25,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:25,727 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:25,728 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:01:25,732 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:01:25,736 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:01:25,739 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:01:25,741 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:01:25,744 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:01:25,749 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:01:25,757 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:01:25,900 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:25,900 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:25,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:25,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:25,912 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:25,912 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:25,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:25,920 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:25,926 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:25,926 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:25,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:25,934 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:25,942 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:25,942 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:25,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:25,952 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:25,955 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:25,955 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:25,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:25,965 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:25,981 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:25,981 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:25,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:25,991 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:26,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:26,004 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:26,022 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:26,024 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:26,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:26,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:26,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:26,025 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:26,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:26,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:26,025 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:26,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37.c_Iteration2_Loop [2019-10-22 09:01:26,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:26,025 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:26,027 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:01:26,031 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:01:26,034 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:01:26,036 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:01:26,038 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:01:26,043 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:01:26,057 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:01:26,065 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:01:26,263 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:26,263 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:26,264 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:01:26,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:26,265 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:26,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,266 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:01:26,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,267 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,267 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:26,267 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,268 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:01:26,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,270 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:26,271 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:26,271 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,272 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:01:26,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:26,273 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:26,273 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,274 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:01:26,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,275 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:26,276 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,278 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:01:26,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,279 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:26,280 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,283 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:01:26,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,284 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:26,284 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:26,285 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,287 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:01:26,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,287 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:26,288 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:26,288 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,289 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 09:01:26,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:01:26,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,290 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,291 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,291 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,291 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,291 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,292 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:01:26,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,294 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,294 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,294 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,294 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,295 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,295 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,296 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:01:26,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,303 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,303 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,304 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:01:26,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,305 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,306 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,306 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,308 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:01:26,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,308 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,308 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,309 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,312 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:01:26,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,313 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,313 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,313 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,314 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,314 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,318 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:01:26,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,319 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,319 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,320 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,320 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,331 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:01:26,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,332 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,332 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,333 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,334 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 09:01:26,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:01:26,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,335 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,336 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,336 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,336 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,340 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:01:26,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,342 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,343 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,343 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,344 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:01:26,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,345 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,345 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,346 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:01:26,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,347 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,347 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,350 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:01:26,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,352 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,352 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,353 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,356 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:01:26,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,357 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,357 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,358 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,368 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:01:26,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,371 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,372 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,372 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,375 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:01:26,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,377 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,377 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,377 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,379 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 09:01:26,380 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:01:26,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,381 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,381 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,381 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,382 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,384 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:01:26,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,385 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,385 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,385 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:01:26,385 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,387 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:01:26,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,389 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,389 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,390 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:01:26,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,393 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,394 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,394 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,395 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:01:26,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,396 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,396 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,396 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,397 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:01:26,397 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,401 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:01:26,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,402 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,402 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,402 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,403 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:01:26,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,418 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:01:26,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,419 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,420 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,424 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:01:26,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:26,425 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,425 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,426 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,428 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 09:01:26,428 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:01:26,429 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,429 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,430 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,430 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,430 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,433 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:01:26,434 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,434 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,435 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,435 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,436 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,436 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:01:26,437 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,438 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,438 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,438 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,439 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,439 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,440 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:01:26,441 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,441 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,441 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,441 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,442 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,442 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,444 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:01:26,445 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,445 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,445 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,445 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,446 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,452 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:01:26,453 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,453 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,453 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,453 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,454 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,455 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,455 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,475 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:01:26,476 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,476 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,476 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,476 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,477 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,477 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,478 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,478 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,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:01:26,486 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,486 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,486 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,486 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:01:26,487 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:01:26,487 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,490 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 09:01:26,490 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:01:26,491 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,491 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:26,491 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,491 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,492 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,495 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:01:26,496 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,496 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:26,496 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,496 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,496 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,498 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,498 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,499 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:01:26,499 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,500 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:26,500 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,500 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,501 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,502 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:01:26,503 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,503 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:26,503 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,503 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,504 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,504 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,507 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:01:26,508 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,508 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:26,508 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,508 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,508 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,510 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,518 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:01:26,518 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,518 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:26,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,519 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,519 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,521 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,521 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,538 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:01:26,539 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,539 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:26,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,539 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,541 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,547 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:01:26,548 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,548 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:01:26,548 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,548 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,550 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,554 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 09:01:26,554 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:01:26,554 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,554 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,554 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,555 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,556 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,560 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:01:26,561 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,561 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,561 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,561 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,563 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:01:26,563 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,564 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:01:26,564 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,564 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,565 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,566 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,567 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:01:26,567 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,568 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,568 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,569 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,569 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,573 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:01:26,574 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,574 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,574 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,574 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,576 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:01:26,576 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,585 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:01:26,585 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,585 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,586 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,586 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,586 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,589 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:01:26,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,606 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:01:26,607 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,607 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,607 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,607 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,609 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,618 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:01:26,618 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,619 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,619 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:01:26,621 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:01:26,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,627 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 09:01:26,627 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:01:26,628 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,628 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,628 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,628 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,629 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,631 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:01:26,631 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,631 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,632 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,632 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,632 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,634 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:01:26,635 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,635 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,635 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,636 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,637 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:01:26,638 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,638 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,638 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,639 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,641 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:01:26,641 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,641 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,642 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,642 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,642 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,648 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:01:26,649 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,649 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,649 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,650 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,650 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:26,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,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:01:26,659 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,659 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,660 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,661 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,670 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:01:26,670 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,670 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:01:26,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,670 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:01:26,671 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:01:26,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,675 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 09:01:26,675 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:01:26,675 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,676 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,676 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:26,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,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:01:26,680 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,681 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,681 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,681 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:26,682 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:26,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,684 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:01:26,684 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,684 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,685 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:26,686 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,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:01:26,688 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,688 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,689 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:26,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,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:01:26,693 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,693 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,694 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,694 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:26,695 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:26,695 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,712 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:01:26,712 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,712 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,712 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,713 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:26,713 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:26,715 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:26,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,747 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:01:26,748 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,748 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,748 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:26,750 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,776 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:01:26,776 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:01:26,776 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:01:26,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:26,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:26,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:26,777 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:01:26,778 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:26,778 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:26,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:26,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,787 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-10-22 09:01:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,195 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-10-22 09:01:27,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:27,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-10-22 09:01:27,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-10-22 09:01:27,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-10-22 09:01:27,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-10-22 09:01:27,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-10-22 09:01:27,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-10-22 09:01:27,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:27,210 INFO L688 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:01:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-10-22 09:01:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-22 09:01:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-22 09:01:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-10-22 09:01:27,234 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:01:27,236 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:01:27,236 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:27,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-10-22 09:01:27,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-10-22 09:01:27,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:27,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:27,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:27,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-10-22 09:01:27,239 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:01:27,239 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:01:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 09:01:27,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654788357] [2019-10-22 09:01:27,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,252 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1689438932, now seen corresponding path program 1 times [2019-10-22 09:01:27,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608640607] [2019-10-22 09:01:27,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,270 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:01:27,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608640607] [2019-10-22 09:01:27,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:27,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915078767] [2019-10-22 09:01:27,271 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:27,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:27,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:27,271 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 3 states. [2019-10-22 09:01:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,780 INFO L93 Difference]: Finished difference Result 1149 states and 1416 transitions. [2019-10-22 09:01:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:27,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1149 states and 1416 transitions. [2019-10-22 09:01:27,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-10-22 09:01:27,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-10-22 09:01:27,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1149 [2019-10-22 09:01:27,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1149 [2019-10-22 09:01:27,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1149 states and 1416 transitions. [2019-10-22 09:01:27,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:27,801 INFO L688 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:01:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states and 1416 transitions. [2019-10-22 09:01:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-10-22 09:01:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-10-22 09:01:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-10-22 09:01:27,822 INFO L711 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:01:27,823 INFO L591 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:01:27,823 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:27,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1416 transitions. [2019-10-22 09:01:27,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-10-22 09:01:27,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:27,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:27,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:27,830 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:01:27,831 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:01:27,831 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:01:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-10-22 09:01:27,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392587263] [2019-10-22 09:01:27,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1352924138, now seen corresponding path program 1 times [2019-10-22 09:01:27,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212448475] [2019-10-22 09:01:27,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,862 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:01:27,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212448475] [2019-10-22 09:01:27,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:27,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410783359] [2019-10-22 09:01:27,863 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:27,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:27,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:27,864 INFO L87 Difference]: Start difference. First operand 1149 states and 1416 transitions. cyclomatic complexity: 268 Second operand 3 states. [2019-10-22 09:01:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,339 INFO L93 Difference]: Finished difference Result 1996 states and 2450 transitions. [2019-10-22 09:01:28,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:28,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1996 states and 2450 transitions. [2019-10-22 09:01:28,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1994 [2019-10-22 09:01:28,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1996 states to 1996 states and 2450 transitions. [2019-10-22 09:01:28,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1996 [2019-10-22 09:01:28,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1996 [2019-10-22 09:01:28,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1996 states and 2450 transitions. [2019-10-22 09:01:28,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:28,370 INFO L688 BuchiCegarLoop]: Abstraction has 1996 states and 2450 transitions. [2019-10-22 09:01:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states and 2450 transitions. [2019-10-22 09:01:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1710. [2019-10-22 09:01:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-10-22 09:01:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2146 transitions. [2019-10-22 09:01:28,401 INFO L711 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-10-22 09:01:28,401 INFO L591 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-10-22 09:01:28,402 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:28,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1710 states and 2146 transitions. [2019-10-22 09:01:28,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1708 [2019-10-22 09:01:28,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:28,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:28,412 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:28,413 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:01:28,413 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:01:28,414 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:01:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-10-22 09:01:28,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857674887] [2019-10-22 09:01:28,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:28,425 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash -879392628, now seen corresponding path program 1 times [2019-10-22 09:01:28,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136977481] [2019-10-22 09:01:28,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,454 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:01:28,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136977481] [2019-10-22 09:01:28,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:28,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:28,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093524619] [2019-10-22 09:01:28,455 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:28,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:28,456 INFO L87 Difference]: Start difference. First operand 1710 states and 2146 transitions. cyclomatic complexity: 437 Second operand 3 states. [2019-10-22 09:01:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,951 INFO L93 Difference]: Finished difference Result 1709 states and 1964 transitions. [2019-10-22 09:01:28,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:28,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1709 states and 1964 transitions. [2019-10-22 09:01:28,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1707 [2019-10-22 09:01:28,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1709 states to 1709 states and 1964 transitions. [2019-10-22 09:01:28,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1709 [2019-10-22 09:01:28,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2019-10-22 09:01:28,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1709 states and 1964 transitions. [2019-10-22 09:01:28,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:28,974 INFO L688 BuchiCegarLoop]: Abstraction has 1709 states and 1964 transitions. [2019-10-22 09:01:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states and 1964 transitions. [2019-10-22 09:01:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1429. [2019-10-22 09:01:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-10-22 09:01:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1654 transitions. [2019-10-22 09:01:28,998 INFO L711 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-10-22 09:01:28,998 INFO L591 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-10-22 09:01:28,998 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:28,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1429 states and 1654 transitions. [2019-10-22 09:01:29,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1427 [2019-10-22 09:01:29,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:29,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:29,007 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:29,007 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:01:29,007 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:01:29,008 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:01:29,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,008 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-10-22 09:01:29,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447750643] [2019-10-22 09:01:29,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,013 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,014 INFO L82 PathProgramCache]: Analyzing trace with hash 274284660, now seen corresponding path program 1 times [2019-10-22 09:01:29,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701971986] [2019-10-22 09:01:29,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,033 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:01:29,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701971986] [2019-10-22 09:01:29,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:29,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:29,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282720501] [2019-10-22 09:01:29,034 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:29,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:29,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:29,035 INFO L87 Difference]: Start difference. First operand 1429 states and 1654 transitions. cyclomatic complexity: 226 Second operand 3 states. [2019-10-22 09:01:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,577 INFO L93 Difference]: Finished difference Result 1851 states and 2102 transitions. [2019-10-22 09:01:29,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:29,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1851 states and 2102 transitions. [2019-10-22 09:01:29,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1846 [2019-10-22 09:01:29,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1851 states to 1851 states and 2102 transitions. [2019-10-22 09:01:29,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1851 [2019-10-22 09:01:29,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1851 [2019-10-22 09:01:29,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1851 states and 2102 transitions. [2019-10-22 09:01:29,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:29,601 INFO L688 BuchiCegarLoop]: Abstraction has 1851 states and 2102 transitions. [2019-10-22 09:01:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states and 2102 transitions. [2019-10-22 09:01:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1849. [2019-10-22 09:01:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-10-22 09:01:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2099 transitions. [2019-10-22 09:01:29,628 INFO L711 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-10-22 09:01:29,628 INFO L591 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-10-22 09:01:29,628 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:29,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1849 states and 2099 transitions. [2019-10-22 09:01:29,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1844 [2019-10-22 09:01:29,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:29,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:29,638 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:29,638 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:01:29,638 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:01:29,639 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:01:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,639 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-10-22 09:01:29,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253081656] [2019-10-22 09:01:29,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,645 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-10-22 09:01:29,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097732512] [2019-10-22 09:01:29,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,679 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:01:29,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097732512] [2019-10-22 09:01:29,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:29,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:29,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817204111] [2019-10-22 09:01:29,680 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:29,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:29,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:29,681 INFO L87 Difference]: Start difference. First operand 1849 states and 2099 transitions. cyclomatic complexity: 252 Second operand 3 states. [2019-10-22 09:01:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:30,181 INFO L93 Difference]: Finished difference Result 1989 states and 2244 transitions. [2019-10-22 09:01:30,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:30,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1989 states and 2244 transitions. [2019-10-22 09:01:30,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-10-22 09:01:30,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-10-22 09:01:30,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1989 [2019-10-22 09:01:30,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1989 [2019-10-22 09:01:30,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1989 states and 2244 transitions. [2019-10-22 09:01:30,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:30,200 INFO L688 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:01:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states and 2244 transitions. [2019-10-22 09:01:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2019-10-22 09:01:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-10-22 09:01:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-10-22 09:01:30,224 INFO L711 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:01:30,224 INFO L591 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:01:30,224 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:01:30,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1989 states and 2244 transitions. [2019-10-22 09:01:30,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-10-22 09:01:30,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:30,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:30,233 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:30,233 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:01:30,233 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:01:30,234 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:01:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,234 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2019-10-22 09:01:30,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650852631] [2019-10-22 09:01:30,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:30,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:30,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1740840234, now seen corresponding path program 1 times [2019-10-22 09:01:30,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902551011] [2019-10-22 09:01:30,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,290 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:01:30,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902551011] [2019-10-22 09:01:30,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:30,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:30,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417495601] [2019-10-22 09:01:30,292 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:30,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:30,294 INFO L87 Difference]: Start difference. First operand 1989 states and 2244 transitions. cyclomatic complexity: 257 Second operand 4 states. [2019-10-22 09:01:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:30,893 INFO L93 Difference]: Finished difference Result 2552 states and 2753 transitions. [2019-10-22 09:01:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:30,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2552 states and 2753 transitions. [2019-10-22 09:01:30,906 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2546 [2019-10-22 09:01:30,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2552 states to 2552 states and 2753 transitions. [2019-10-22 09:01:30,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2552 [2019-10-22 09:01:30,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2552 [2019-10-22 09:01:30,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2552 states and 2753 transitions. [2019-10-22 09:01:30,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:30,922 INFO L688 BuchiCegarLoop]: Abstraction has 2552 states and 2753 transitions. [2019-10-22 09:01:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states and 2753 transitions. [2019-10-22 09:01:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2130. [2019-10-22 09:01:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-10-22 09:01:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2325 transitions. [2019-10-22 09:01:30,952 INFO L711 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-10-22 09:01:30,952 INFO L591 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-10-22 09:01:30,952 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:01:30,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2130 states and 2325 transitions. [2019-10-22 09:01:30,958 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2124 [2019-10-22 09:01:30,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:30,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:30,960 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:30,960 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:01:30,960 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:01:30,960 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:01:30,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,961 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2019-10-22 09:01:30,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146911098] [2019-10-22 09:01:30,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:30,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1701192337, now seen corresponding path program 1 times [2019-10-22 09:01:30,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045842988] [2019-10-22 09:01:30,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,011 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:01:31,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045842988] [2019-10-22 09:01:31,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:31,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:31,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953463425] [2019-10-22 09:01:31,012 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:31,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:31,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:31,012 INFO L87 Difference]: Start difference. First operand 2130 states and 2325 transitions. cyclomatic complexity: 198 Second operand 3 states. [2019-10-22 09:01:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:31,225 INFO L93 Difference]: Finished difference Result 1838 states and 1967 transitions. [2019-10-22 09:01:31,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:31,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1838 states and 1967 transitions. [2019-10-22 09:01:31,232 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1833 [2019-10-22 09:01:31,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1838 states to 1838 states and 1967 transitions. [2019-10-22 09:01:31,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1838 [2019-10-22 09:01:31,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1838 [2019-10-22 09:01:31,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1838 states and 1967 transitions. [2019-10-22 09:01:31,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:31,242 INFO L688 BuchiCegarLoop]: Abstraction has 1838 states and 1967 transitions. [2019-10-22 09:01:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states and 1967 transitions. [2019-10-22 09:01:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1278. [2019-10-22 09:01:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-10-22 09:01:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1407 transitions. [2019-10-22 09:01:31,260 INFO L711 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-10-22 09:01:31,260 INFO L591 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-10-22 09:01:31,260 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:01:31,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1278 states and 1407 transitions. [2019-10-22 09:01:31,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1273 [2019-10-22 09:01:31,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:31,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:31,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:31,265 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:01:31,265 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:01:31,265 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:01:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,266 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2019-10-22 09:01:31,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980640647] [2019-10-22 09:01:31,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:31,271 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -645173945, now seen corresponding path program 1 times [2019-10-22 09:01:31,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105103516] [2019-10-22 09:01:31,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,326 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:01:31,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105103516] [2019-10-22 09:01:31,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:31,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:31,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064490921] [2019-10-22 09:01:31,327 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:31,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:31,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:31,328 INFO L87 Difference]: Start difference. First operand 1278 states and 1407 transitions. cyclomatic complexity: 133 Second operand 3 states. [2019-10-22 09:01:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:31,648 INFO L93 Difference]: Finished difference Result 1841 states and 1970 transitions. [2019-10-22 09:01:31,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:31,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1841 states and 1970 transitions. [2019-10-22 09:01:31,652 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1835 [2019-10-22 09:01:31,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1841 states to 1841 states and 1970 transitions. [2019-10-22 09:01:31,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1841 [2019-10-22 09:01:31,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1841 [2019-10-22 09:01:31,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 1970 transitions. [2019-10-22 09:01:31,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:31,660 INFO L688 BuchiCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2019-10-22 09:01:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 1970 transitions. [2019-10-22 09:01:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1418. [2019-10-22 09:01:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-10-22 09:01:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1541 transitions. [2019-10-22 09:01:31,679 INFO L711 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-10-22 09:01:31,679 INFO L591 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-10-22 09:01:31,679 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:01:31,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1418 states and 1541 transitions. [2019-10-22 09:01:31,682 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1412 [2019-10-22 09:01:31,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:31,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:31,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:31,683 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:01:31,683 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:01:31,683 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:01:31,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,684 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2019-10-22 09:01:31,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058409928] [2019-10-22 09:01:31,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:31,688 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:31,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-10-22 09:01:31,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304310834] [2019-10-22 09:01:31,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:31,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-10-22 09:01:31,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28218813] [2019-10-22 09:01:31,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,206 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:01:32,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28218813] [2019-10-22 09:01:32,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:32,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 09:01:32,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603455625] [2019-10-22 09:01:33,018 WARN L191 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-10-22 09:01:33,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:01:33,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:33,101 INFO L87 Difference]: Start difference. First operand 1418 states and 1541 transitions. cyclomatic complexity: 128 Second operand 9 states. [2019-10-22 09:01:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,608 INFO L93 Difference]: Finished difference Result 1330 states and 1452 transitions. [2019-10-22 09:01:33,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:33,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 1452 transitions. [2019-10-22 09:01:33,612 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-10-22 09:01:33,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-10-22 09:01:33,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2019-10-22 09:01:33,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2019-10-22 09:01:33,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 1452 transitions. [2019-10-22 09:01:33,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:33,619 INFO L688 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:01:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 1452 transitions. [2019-10-22 09:01:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2019-10-22 09:01:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-22 09:01:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-10-22 09:01:33,664 INFO L711 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:01:33,664 INFO L591 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:01:33,664 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:01:33,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1452 transitions. [2019-10-22 09:01:33,667 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-10-22 09:01:33,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:33,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:33,668 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:33,668 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:33,668 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:01:33,668 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:01:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-10-22 09:01:33,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091969979] [2019-10-22 09:01:33,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-10-22 09:01:33,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41579293] [2019-10-22 09:01:33,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,680 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-10-22 09:01:33,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718205671] [2019-10-22 09:01:33,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,688 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,855 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:33,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:33,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:33,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:33,855 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:33,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:33,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:33,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:33,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37.c_Iteration12_Lasso [2019-10-22 09:01:33,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:33,855 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:33,857 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:01:33,859 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:01:33,862 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:01:33,863 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:01:33,864 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:01:33,866 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:01:33,876 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:01:33,877 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:01:33,879 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:01:33,881 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:01:33,882 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:01:33,884 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:01:33,885 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:01:33,887 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:01:33,889 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:01:33,896 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:01:33,908 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:01:33,910 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:01:33,912 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:01:33,918 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:01:33,921 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:01:34,086 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:34,086 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,092 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,092 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,099 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,107 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,107 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) [2019-10-22 09:01:34,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,112 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,125 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,125 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,133 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:01:34,141 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,141 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,149 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,149 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,154 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:01:34,157 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,157 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,166 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:01:34,168 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,168 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,180 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,180 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,186 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,186 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,192 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,192 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,202 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:01:34,204 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,205 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,210 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,210 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,216 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,216 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,221 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,221 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,225 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:34,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:34,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,409 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,409 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,416 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,416 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,426 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,426 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,430 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:34,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,534 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,535 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,540 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,540 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_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/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:01:34,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:34,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:34,546 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:34,546 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:01:34,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:34 BoogieIcfgContainer [2019-10-22 09:01:34,569 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:34,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:34,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:34,570 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:34,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:21" (3/4) ... [2019-10-22 09:01:34,573 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:01:34,611 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_01c8ee71-e28f-49f3-a00b-5a9fa1ea6d2b/bin/uautomizer/witness.graphml [2019-10-22 09:01:34,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:34,613 INFO L168 Benchmark]: Toolchain (without parser) took 14864.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 493.4 MB). Free memory was 939.1 MB in the beginning and 1.0 GB in the end (delta: -86.6 MB). Peak memory consumption was 406.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,613 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:34,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.51 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:01:34,614 INFO L168 Benchmark]: Boogie Preprocessor took 75.94 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.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,614 INFO L168 Benchmark]: RCFGBuilder took 1313.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.9 MB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,614 INFO L168 Benchmark]: BuchiAutomizer took 12689.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.9 MB). Free memory was 999.9 MB in the beginning and 1.0 GB in the end (delta: -42.0 MB). Peak memory consumption was 311.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,615 INFO L168 Benchmark]: Witness Printer took 41.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,616 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 634.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.51 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 75.94 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.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1313.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.9 MB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12689.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.9 MB). Free memory was 999.9 MB in the beginning and 1.0 GB in the end (delta: -42.0 MB). Peak memory consumption was 311.9 MB. Max. memory is 11.5 GB. * Witness Printer took 41.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.6s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 6.5s. Construction of modules took 3.9s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.3s 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.9s 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: 158ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70b8d8aa=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28a7a953=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@70b8d8aa=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28a7a953=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@70b8d8aa=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@28a7a953=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...