./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.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_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/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 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:57:48,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:48,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:48,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:48,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:48,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:48,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:48,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:48,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:48,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:48,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:48,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:48,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:48,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:48,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:48,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:48,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:48,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:48,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:48,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:48,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:48,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:48,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:48,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:48,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:48,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:48,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:48,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:48,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:48,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:48,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:48,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:48,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:48,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:48,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:48,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:48,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:48,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:48,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:48,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:48,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:48,948 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:48,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:48,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:48,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:48,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:48,963 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:48,963 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:48,964 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:48,964 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:48,964 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:48,964 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:48,964 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:48,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:48,965 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:48,965 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:48,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:48,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:48,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:48,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:48,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:48,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:48,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:48,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:48,967 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:48,967 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:48,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:48,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:48,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:48,968 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:48,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:48,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:48,968 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:48,969 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:48,969 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_3c2299fb-028d-4df8-922f-61d33570361c/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 -> 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 [2019-10-22 08:57:48,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:49,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:49,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:49,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:49,010 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:49,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2019-10-22 08:57:49,064 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/data/88fd36ef9/5df25dcede93451a9dabdb128cd8c710/FLAG62b01b51b [2019-10-22 08:57:49,534 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:49,535 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2019-10-22 08:57:49,551 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/data/88fd36ef9/5df25dcede93451a9dabdb128cd8c710/FLAG62b01b51b [2019-10-22 08:57:50,035 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/data/88fd36ef9/5df25dcede93451a9dabdb128cd8c710 [2019-10-22 08:57:50,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:50,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:50,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:50,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:50,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:50,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0a3f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50, skipping insertion in model container [2019-10-22 08:57:50,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,053 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:50,089 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:50,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:50,546 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:50,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:50,667 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:50,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50 WrapperNode [2019-10-22 08:57:50,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:50,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:50,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:50,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:50,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:50,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:50,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:50,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:50,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:50,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:50,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:50,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:50,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:50,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:50,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:51,810 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:51,810 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:57:51,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51 BoogieIcfgContainer [2019-10-22 08:57:51,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:51,812 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:51,812 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:51,818 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:51,819 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:50" (1/3) ... [2019-10-22 08:57:51,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71a8d776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:51, skipping insertion in model container [2019-10-22 08:57:51,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50" (2/3) ... [2019-10-22 08:57:51,821 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71a8d776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:51, skipping insertion in model container [2019-10-22 08:57:51,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51" (3/3) ... [2019-10-22 08:57:51,823 INFO L371 chiAutomizerObserver]: Analyzing ICFG Problem02_label59.c [2019-10-22 08:57:51,865 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:51,865 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:51,865 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:51,866 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:51,866 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:51,866 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:51,866 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:51,866 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:51,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-10-22 08:57:51,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-10-22 08:57:51,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:51,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:51,936 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:51,936 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:51,936 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:51,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-10-22 08:57:51,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-10-22 08:57:51,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:51,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:51,951 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:51,951 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:51,960 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 08:57:51,960 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 08:57:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:57:51,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77062915] [2019-10-22 08:57:51,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,071 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-10-22 08:57:52,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:52,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941873985] [2019-10-22 08:57:52,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,107 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-10-22 08:57:52,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:52,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900012677] [2019-10-22 08:57:52,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:52,186 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 08:57:52,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900012677] [2019-10-22 08:57:52,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:52,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:52,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470908804] [2019-10-22 08:57:52,345 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:52,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:52,346 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:52,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:52,347 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:57:52,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:52,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:52,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:52,347 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59.c_Iteration1_Loop [2019-10-22 08:57:52,348 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:52,348 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:52,377 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 08:57:52,385 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 08:57:52,422 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 08:57:52,429 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 08:57:52,434 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 08:57:52,438 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 08:57:52,440 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 08:57:52,452 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 08:57:52,698 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-10-22 08:57:52,762 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:52,764 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:57:52,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:52,773 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:52,784 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:52,784 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_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:57:52,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:52,797 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:52,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:52,806 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:52,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:52,815 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 08:57:52,822 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:52,823 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_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:52,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:52,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:52,848 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:52,849 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:52,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:52,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:52,868 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:52,868 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:52,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:52,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:52,910 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:52,910 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:52,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:52,919 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 08:57:52,929 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:52,929 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:52,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:52,939 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:52,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:57:52,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:52,974 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:57:52,977 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:52,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:52,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:52,978 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:52,978 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:52,978 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:52,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:52,978 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:52,978 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59.c_Iteration1_Loop [2019-10-22 08:57:52,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:52,979 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:52,983 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 08:57:52,999 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 08:57:53,003 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 08:57:53,052 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 08:57:53,060 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 08:57:53,063 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 08:57:53,070 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 08:57:53,074 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 08:57:53,302 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-10-22 08:57:53,338 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:53,342 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:53,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,362 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,378 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,379 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,379 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,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 08:57:53,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,388 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:53,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,390 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:53,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,447 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,456 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,457 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,457 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,461 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,461 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,470 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,471 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,471 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,473 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,473 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:53,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,474 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,474 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,483 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 08:57:53,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,485 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,486 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,486 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,487 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,489 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,510 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,510 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,515 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:53,515 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,522 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 08:57:53,522 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,568 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,568 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,569 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,569 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,585 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,585 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,596 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,597 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,600 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,601 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,601 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,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 08:57:53,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,602 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,602 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,602 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:53,602 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,611 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:53,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,616 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 08:57:53,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,617 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,617 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,618 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,618 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,625 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,626 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,630 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:53,630 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,632 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:53,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,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 08:57:53,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,657 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,657 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,664 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,665 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,671 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,671 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,671 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,672 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,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 08:57:53,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,678 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,678 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,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 08:57:53,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,680 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:53,681 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,681 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:53,681 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,689 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 08:57:53,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,691 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:53,692 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:53,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,709 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:53,710 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:53,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,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 08:57:53,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,713 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:53,713 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:53,720 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-10-22 08:57:53,720 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,751 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,753 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:53,753 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:53,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,768 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:53,769 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:53,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,773 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,774 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:53,774 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:53,774 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,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 08:57:53,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,777 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,777 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:53,778 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:53,778 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,787 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:53,787 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:53,788 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:57:53,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,800 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 08:57:53,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 08:57:53,801 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,801 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:53,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,802 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,805 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,818 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,818 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:53,818 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,819 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,820 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,823 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,823 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:53,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,824 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:53,824 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,826 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 08:57:53,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,850 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,850 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:53,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,851 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,852 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,857 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,857 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:53,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,858 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,858 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,861 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,862 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:53,862 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,862 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,862 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,866 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,866 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:53,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,866 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,867 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:53,867 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,868 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,869 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:53,869 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,869 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:53,869 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:53,870 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:53,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,875 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 08:57:53,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,876 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,876 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:53,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,876 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,878 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,893 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,894 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:53,894 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,894 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,895 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,895 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,899 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,899 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:53,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,900 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:53,900 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,903 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:53,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,967 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,967 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:53,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,968 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,969 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,969 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,974 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,974 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:53,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,975 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,975 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,976 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,979 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,979 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:53,980 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,980 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,980 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,984 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,984 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:53,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,985 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,985 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,985 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:53,985 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,987 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,988 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:53,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,988 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:53,988 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:53,989 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:53,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,996 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 08:57:53,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,997 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:53,997 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:53,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,998 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:54,000 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:54,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,012 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,012 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,012 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:54,013 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:54,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,019 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,019 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,019 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:54,019 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:54,024 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-10-22 08:57:54,025 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,165 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,165 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,166 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:54,167 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:54,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,192 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,192 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,192 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:54,193 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:54,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,198 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,199 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,199 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,199 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:54,200 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:54,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,206 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,206 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,206 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,207 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:54,208 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:54,208 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,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 08:57:54,209 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,209 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,209 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,210 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:54,210 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:54,212 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:57:54,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,222 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 08:57:54,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 08:57:54,223 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,223 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:54,224 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,224 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:54,225 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:54,225 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,235 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,235 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:54,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,235 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:54,236 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:54,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,238 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,238 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:54,238 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,239 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:54,239 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:54,241 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:54,241 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,283 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,283 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:54,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,284 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:54,284 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:54,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,292 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,292 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:54,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,293 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:54,293 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:54,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,304 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,304 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:54,304 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,304 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:54,305 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:54,305 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,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 08:57:54,308 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,308 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:54,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,309 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,309 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:54,309 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:54,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,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 08:57:54,312 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,312 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:54,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,312 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:54,312 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:54,313 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:54,313 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,323 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 08:57:54,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,324 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,325 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,325 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:54,327 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,327 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,462 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,462 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,462 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:54,463 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,469 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,469 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,469 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,469 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 08:57:54,469 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:54,473 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-10-22 08:57:54,473 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,615 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,615 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,616 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:54,617 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,626 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,626 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,626 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:54,627 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,630 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,630 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,630 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:54,631 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,631 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,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 08:57:54,635 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,635 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,636 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:54,636 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,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 08:57:54,644 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:54,644 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:54,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,644 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:54,644 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:54,645 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:54,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:54,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:54,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:54,671 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-10-22 08:57:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:55,406 INFO L93 Difference]: Finished difference Result 374 states and 489 transitions. [2019-10-22 08:57:55,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:55,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 489 transitions. [2019-10-22 08:57:55,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 305 [2019-10-22 08:57:55,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 307 states and 409 transitions. [2019-10-22 08:57:55,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2019-10-22 08:57:55,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2019-10-22 08:57:55,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 409 transitions. [2019-10-22 08:57:55,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:55,436 INFO L688 BuchiCegarLoop]: Abstraction has 307 states and 409 transitions. [2019-10-22 08:57:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 409 transitions. [2019-10-22 08:57:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-22 08:57:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-22 08:57:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-10-22 08:57:55,493 INFO L711 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-10-22 08:57:55,493 INFO L591 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-10-22 08:57:55,493 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:55,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-10-22 08:57:55,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-10-22 08:57:55,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:55,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:55,497 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:55,497 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:55,497 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 08:57:55,497 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 08:57:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:57:55,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:55,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982153189] [2019-10-22 08:57:55,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:55,512 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-10-22 08:57:55,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:55,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904689176] [2019-10-22 08:57:55,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:55,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-10-22 08:57:55,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:55,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084423507] [2019-10-22 08:57:55,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:55,554 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 08:57:55,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084423507] [2019-10-22 08:57:55,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:55,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:55,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703645817] [2019-10-22 08:57:55,677 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:55,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:55,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:55,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:55,677 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:57:55,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:55,677 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:55,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59.c_Iteration2_Loop [2019-10-22 08:57:55,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:55,678 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:55,679 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 08:57:55,682 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 08:57:55,686 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 08:57:55,689 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 08:57:55,691 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 08:57:55,693 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 08:57:55,698 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 08:57:55,705 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 08:57:55,845 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:55,845 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:55,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:55,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:55,857 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:55,857 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_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:55,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:55,872 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:55,872 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:55,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:55,879 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 08:57:55,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:55,883 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:55,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:55,893 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 08:57:55,897 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:55,897 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_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:55,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:55,925 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:57:55,925 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:57:55,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:57:55,934 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_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:57:55,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:57:55,964 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:57:55,965 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:55,965 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:55,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:55,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:55,966 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:55,966 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,966 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:55,966 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:55,966 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59.c_Iteration2_Loop [2019-10-22 08:57:55,966 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:55,966 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:55,968 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 08:57:55,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,984 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 08:57:55,987 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 08:57:55,990 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 08:57:55,996 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 08:57:56,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 08:57:56,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 08:57:56,191 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:56,191 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:56,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,192 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:56,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,194 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,194 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,195 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:56,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,198 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:56,198 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,201 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,201 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,204 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,205 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,208 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,209 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:56,209 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:56,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,214 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 08:57:56,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,215 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,215 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,216 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,216 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,218 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,218 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,218 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,220 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,220 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,221 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,221 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,222 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,222 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,222 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,222 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,225 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,225 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,225 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,225 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,225 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,229 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,229 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,230 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,230 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,235 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,236 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,240 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,240 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,242 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 08:57:56,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,242 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,243 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,243 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,246 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,246 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,246 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,246 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,248 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,248 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,249 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,250 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,250 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,250 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,250 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,253 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,253 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,254 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,258 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,258 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,258 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,259 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,259 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,265 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,265 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,269 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,270 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,272 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 08:57:56,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 08:57:56,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,273 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,274 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,274 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,276 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,276 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,276 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,277 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:57:56,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,278 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,278 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,280 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,280 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,280 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,281 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,281 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,284 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,284 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,284 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:57:56,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,289 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,289 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,289 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,290 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:57:56,290 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,297 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,297 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,297 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,297 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,302 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,303 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,305 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 08:57:56,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,306 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,306 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,306 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,307 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,309 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,310 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,310 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,310 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,310 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,312 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,312 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,312 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,313 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,313 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,314 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,314 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,314 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,315 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,317 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,318 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,318 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,318 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,318 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,323 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,323 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,324 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,324 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,325 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,325 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,332 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,332 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,333 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,333 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,341 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,341 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,342 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:57:56,342 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:57:56,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,345 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 08:57:56,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,345 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,346 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:56,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,346 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,346 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,350 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,350 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:56,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,350 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,350 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,351 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,353 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,353 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:56,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,353 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,354 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,355 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,356 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:56,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,356 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,356 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,356 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,360 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,360 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:56,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,360 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,360 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,361 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,361 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,368 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,368 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:56,368 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,368 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,369 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,370 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,370 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,388 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,388 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:56,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,389 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,390 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,396 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,396 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 08:57:56,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,397 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,398 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,398 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,401 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 08:57:56,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,402 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,402 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,402 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,403 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,403 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,408 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,408 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,408 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,408 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,410 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:57:56,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,411 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,412 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,412 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,413 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,413 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,414 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,414 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,414 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,416 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,416 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,420 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,420 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,420 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,420 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,422 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:57:56,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,431 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,432 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,432 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,432 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,432 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,434 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 08:57:56,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,454 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,455 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,455 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,457 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,457 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,469 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,469 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,469 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,469 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 08:57:56,470 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 08:57:56,471 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,477 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 08:57:56,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,478 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,478 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,478 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,478 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,479 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,479 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,481 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,482 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,482 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,482 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,482 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,482 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,485 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,485 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,485 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,485 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,485 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,485 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,485 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,485 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,487 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,488 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,488 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,488 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,488 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,490 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,490 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,490 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,491 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,491 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,491 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,498 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,498 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,498 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,498 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,498 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,499 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:56,499 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,508 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,508 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,508 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,508 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,509 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,509 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,519 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,520 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 08:57:56,520 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,520 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 08:57:56,520 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:57:56,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,524 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 08:57:56,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 08:57:56,525 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,525 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,525 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,525 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:56,526 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,526 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,530 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,530 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,531 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,531 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:56,531 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:56,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,534 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,534 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,534 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:56,535 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,538 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,538 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,538 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,538 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:56,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,539 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,542 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,542 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,542 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,542 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,543 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:56,544 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:56,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,564 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,564 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,564 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:56,564 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:56,566 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:56,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:56,605 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,605 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,605 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:56,607 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,607 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,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 08:57:56,639 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 08:57:56,639 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 08:57:56,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:56,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,640 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 08:57:56,640 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:56,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:56,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:56,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:56,650 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-10-22 08:57:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:57,098 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-10-22 08:57:57,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:57,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-10-22 08:57:57,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-10-22 08:57:57,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-10-22 08:57:57,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-10-22 08:57:57,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-10-22 08:57:57,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-10-22 08:57:57,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:57,109 INFO L688 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 08:57:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-10-22 08:57:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-22 08:57:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-22 08:57:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-10-22 08:57:57,131 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 08:57:57,131 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 08:57:57,131 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:57,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-10-22 08:57:57,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-10-22 08:57:57,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:57,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:57,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:57,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-10-22 08:57:57,136 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 08:57:57,136 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 08:57:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 08:57:57,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420437807] [2019-10-22 08:57:57,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,142 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1689438932, now seen corresponding path program 1 times [2019-10-22 08:57:57,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432092450] [2019-10-22 08:57:57,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:57,154 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 08:57:57,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432092450] [2019-10-22 08:57:57,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:57,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:57,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495091072] [2019-10-22 08:57:57,155 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:57,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:57,155 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 3 states. [2019-10-22 08:57:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:57,685 INFO L93 Difference]: Finished difference Result 1149 states and 1416 transitions. [2019-10-22 08:57:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:57,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1149 states and 1416 transitions. [2019-10-22 08:57:57,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-10-22 08:57:57,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-10-22 08:57:57,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1149 [2019-10-22 08:57:57,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1149 [2019-10-22 08:57:57,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1149 states and 1416 transitions. [2019-10-22 08:57:57,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:57,702 INFO L688 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 08:57:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states and 1416 transitions. [2019-10-22 08:57:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-10-22 08:57:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-10-22 08:57:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-10-22 08:57:57,741 INFO L711 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 08:57:57,741 INFO L591 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 08:57:57,741 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:57,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1416 transitions. [2019-10-22 08:57:57,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-10-22 08:57:57,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:57,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:57,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:57,750 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 08:57:57,750 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 08:57:57,751 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 08:57:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-10-22 08:57:57,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085872155] [2019-10-22 08:57:57,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,764 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1352924138, now seen corresponding path program 1 times [2019-10-22 08:57:57,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265874871] [2019-10-22 08:57:57,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:57,789 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 08:57:57,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265874871] [2019-10-22 08:57:57,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:57,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:57,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325824749] [2019-10-22 08:57:57,790 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:57,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:57,790 INFO L87 Difference]: Start difference. First operand 1149 states and 1416 transitions. cyclomatic complexity: 268 Second operand 3 states. [2019-10-22 08:57:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:58,228 INFO L93 Difference]: Finished difference Result 1996 states and 2450 transitions. [2019-10-22 08:57:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:58,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1996 states and 2450 transitions. [2019-10-22 08:57:58,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1994 [2019-10-22 08:57:58,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1996 states to 1996 states and 2450 transitions. [2019-10-22 08:57:58,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1996 [2019-10-22 08:57:58,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1996 [2019-10-22 08:57:58,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1996 states and 2450 transitions. [2019-10-22 08:57:58,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:58,253 INFO L688 BuchiCegarLoop]: Abstraction has 1996 states and 2450 transitions. [2019-10-22 08:57:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states and 2450 transitions. [2019-10-22 08:57:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1710. [2019-10-22 08:57:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-10-22 08:57:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2146 transitions. [2019-10-22 08:57:58,277 INFO L711 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-10-22 08:57:58,277 INFO L591 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-10-22 08:57:58,277 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:58,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1710 states and 2146 transitions. [2019-10-22 08:57:58,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1708 [2019-10-22 08:57:58,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:58,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:58,287 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:58,287 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 08:57:58,287 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 08:57:58,288 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 08:57:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-10-22 08:57:58,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:58,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983677477] [2019-10-22 08:57:58,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:58,293 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash -879392628, now seen corresponding path program 1 times [2019-10-22 08:57:58,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:58,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82673291] [2019-10-22 08:57:58,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,339 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 08:57:58,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82673291] [2019-10-22 08:57:58,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:58,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:58,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963966882] [2019-10-22 08:57:58,340 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:58,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:58,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:58,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:58,341 INFO L87 Difference]: Start difference. First operand 1710 states and 2146 transitions. cyclomatic complexity: 437 Second operand 3 states. [2019-10-22 08:57:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:58,765 INFO L93 Difference]: Finished difference Result 1709 states and 1964 transitions. [2019-10-22 08:57:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:58,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1709 states and 1964 transitions. [2019-10-22 08:57:58,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1707 [2019-10-22 08:57:58,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1709 states to 1709 states and 1964 transitions. [2019-10-22 08:57:58,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1709 [2019-10-22 08:57:58,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2019-10-22 08:57:58,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1709 states and 1964 transitions. [2019-10-22 08:57:58,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:58,791 INFO L688 BuchiCegarLoop]: Abstraction has 1709 states and 1964 transitions. [2019-10-22 08:57:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states and 1964 transitions. [2019-10-22 08:57:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1429. [2019-10-22 08:57:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-10-22 08:57:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1654 transitions. [2019-10-22 08:57:58,810 INFO L711 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-10-22 08:57:58,811 INFO L591 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-10-22 08:57:58,811 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:58,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1429 states and 1654 transitions. [2019-10-22 08:57:58,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1427 [2019-10-22 08:57:58,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:58,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:58,819 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:58,820 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 08:57:58,821 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 08:57:58,821 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 08:57:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-10-22 08:57:58,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:58,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509887762] [2019-10-22 08:57:58,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:58,828 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:58,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:58,832 INFO L82 PathProgramCache]: Analyzing trace with hash 274284660, now seen corresponding path program 1 times [2019-10-22 08:57:58,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:58,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712888392] [2019-10-22 08:57:58,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,861 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 08:57:58,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712888392] [2019-10-22 08:57:58,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:58,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:58,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070338002] [2019-10-22 08:57:58,862 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:58,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:58,862 INFO L87 Difference]: Start difference. First operand 1429 states and 1654 transitions. cyclomatic complexity: 226 Second operand 3 states. [2019-10-22 08:57:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:59,423 INFO L93 Difference]: Finished difference Result 1851 states and 2102 transitions. [2019-10-22 08:57:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:59,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1851 states and 2102 transitions. [2019-10-22 08:57:59,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1846 [2019-10-22 08:57:59,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1851 states to 1851 states and 2102 transitions. [2019-10-22 08:57:59,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1851 [2019-10-22 08:57:59,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1851 [2019-10-22 08:57:59,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1851 states and 2102 transitions. [2019-10-22 08:57:59,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:59,451 INFO L688 BuchiCegarLoop]: Abstraction has 1851 states and 2102 transitions. [2019-10-22 08:57:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states and 2102 transitions. [2019-10-22 08:57:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1849. [2019-10-22 08:57:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-10-22 08:57:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2099 transitions. [2019-10-22 08:57:59,480 INFO L711 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-10-22 08:57:59,480 INFO L591 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-10-22 08:57:59,481 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:57:59,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1849 states and 2099 transitions. [2019-10-22 08:57:59,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1844 [2019-10-22 08:57:59,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:59,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:59,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:59,493 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 08:57:59,493 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 08:57:59,494 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 08:57:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-10-22 08:57:59,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:59,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735009697] [2019-10-22 08:57:59,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:59,503 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-10-22 08:57:59,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:59,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744866703] [2019-10-22 08:57:59,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:59,565 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 08:57:59,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744866703] [2019-10-22 08:57:59,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:59,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:59,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146299223] [2019-10-22 08:57:59,566 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:59,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:59,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:59,571 INFO L87 Difference]: Start difference. First operand 1849 states and 2099 transitions. cyclomatic complexity: 252 Second operand 3 states. [2019-10-22 08:57:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:59,929 INFO L93 Difference]: Finished difference Result 1989 states and 2244 transitions. [2019-10-22 08:57:59,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:59,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1989 states and 2244 transitions. [2019-10-22 08:57:59,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-10-22 08:57:59,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-10-22 08:57:59,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1989 [2019-10-22 08:57:59,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1989 [2019-10-22 08:57:59,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1989 states and 2244 transitions. [2019-10-22 08:57:59,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:59,951 INFO L688 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 08:57:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states and 2244 transitions. [2019-10-22 08:57:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2019-10-22 08:57:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-10-22 08:57:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-10-22 08:57:59,974 INFO L711 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 08:57:59,974 INFO L591 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 08:57:59,974 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:57:59,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1989 states and 2244 transitions. [2019-10-22 08:57:59,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-10-22 08:57:59,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:59,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:59,982 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:59,982 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 08:57:59,982 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 08:57:59,983 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 08:57:59,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:59,983 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2019-10-22 08:57:59,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:59,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759971465] [2019-10-22 08:57:59,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:59,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1740840234, now seen corresponding path program 1 times [2019-10-22 08:57:59,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:59,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098765575] [2019-10-22 08:57:59,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,032 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 08:58:00,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098765575] [2019-10-22 08:58:00,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:00,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:00,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373079512] [2019-10-22 08:58:00,033 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:00,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:00,034 INFO L87 Difference]: Start difference. First operand 1989 states and 2244 transitions. cyclomatic complexity: 257 Second operand 4 states. [2019-10-22 08:58:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:00,565 INFO L93 Difference]: Finished difference Result 2552 states and 2753 transitions. [2019-10-22 08:58:00,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:00,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2552 states and 2753 transitions. [2019-10-22 08:58:00,573 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2546 [2019-10-22 08:58:00,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2552 states to 2552 states and 2753 transitions. [2019-10-22 08:58:00,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2552 [2019-10-22 08:58:00,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2552 [2019-10-22 08:58:00,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2552 states and 2753 transitions. [2019-10-22 08:58:00,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:00,589 INFO L688 BuchiCegarLoop]: Abstraction has 2552 states and 2753 transitions. [2019-10-22 08:58:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states and 2753 transitions. [2019-10-22 08:58:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2130. [2019-10-22 08:58:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-10-22 08:58:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2325 transitions. [2019-10-22 08:58:00,615 INFO L711 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-10-22 08:58:00,615 INFO L591 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-10-22 08:58:00,615 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:58:00,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2130 states and 2325 transitions. [2019-10-22 08:58:00,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2124 [2019-10-22 08:58:00,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:00,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:00,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:00,623 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 08:58:00,623 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 08:58:00,623 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 08:58:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2019-10-22 08:58:00,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585110395] [2019-10-22 08:58:00,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1701192337, now seen corresponding path program 1 times [2019-10-22 08:58:00,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91868173] [2019-10-22 08:58:00,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,681 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 08:58:00,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91868173] [2019-10-22 08:58:00,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:00,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:00,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623794167] [2019-10-22 08:58:00,682 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:00,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:00,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:00,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:00,682 INFO L87 Difference]: Start difference. First operand 2130 states and 2325 transitions. cyclomatic complexity: 198 Second operand 3 states. [2019-10-22 08:58:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:00,890 INFO L93 Difference]: Finished difference Result 1838 states and 1967 transitions. [2019-10-22 08:58:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:00,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1838 states and 1967 transitions. [2019-10-22 08:58:00,893 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1833 [2019-10-22 08:58:00,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1838 states to 1838 states and 1967 transitions. [2019-10-22 08:58:00,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1838 [2019-10-22 08:58:00,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1838 [2019-10-22 08:58:00,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1838 states and 1967 transitions. [2019-10-22 08:58:00,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:00,901 INFO L688 BuchiCegarLoop]: Abstraction has 1838 states and 1967 transitions. [2019-10-22 08:58:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states and 1967 transitions. [2019-10-22 08:58:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1278. [2019-10-22 08:58:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-10-22 08:58:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1407 transitions. [2019-10-22 08:58:00,917 INFO L711 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-10-22 08:58:00,917 INFO L591 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-10-22 08:58:00,917 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:58:00,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1278 states and 1407 transitions. [2019-10-22 08:58:00,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1273 [2019-10-22 08:58:00,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:00,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:00,922 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:00,922 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 08:58:00,922 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 08:58:00,922 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 08:58:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2019-10-22 08:58:00,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516870304] [2019-10-22 08:58:00,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,927 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash -645173945, now seen corresponding path program 1 times [2019-10-22 08:58:00,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200528847] [2019-10-22 08:58:00,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,978 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 08:58:00,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200528847] [2019-10-22 08:58:00,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:00,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:00,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500850819] [2019-10-22 08:58:00,979 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:00,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:00,980 INFO L87 Difference]: Start difference. First operand 1278 states and 1407 transitions. cyclomatic complexity: 133 Second operand 3 states. [2019-10-22 08:58:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:01,335 INFO L93 Difference]: Finished difference Result 1841 states and 1970 transitions. [2019-10-22 08:58:01,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:01,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1841 states and 1970 transitions. [2019-10-22 08:58:01,342 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1835 [2019-10-22 08:58:01,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1841 states to 1841 states and 1970 transitions. [2019-10-22 08:58:01,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1841 [2019-10-22 08:58:01,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1841 [2019-10-22 08:58:01,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 1970 transitions. [2019-10-22 08:58:01,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:01,356 INFO L688 BuchiCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2019-10-22 08:58:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 1970 transitions. [2019-10-22 08:58:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1418. [2019-10-22 08:58:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-10-22 08:58:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1541 transitions. [2019-10-22 08:58:01,379 INFO L711 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-10-22 08:58:01,379 INFO L591 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-10-22 08:58:01,379 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:58:01,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1418 states and 1541 transitions. [2019-10-22 08:58:01,383 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1412 [2019-10-22 08:58:01,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:01,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:01,384 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:01,384 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 08:58:01,384 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 08:58:01,385 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 08:58:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2019-10-22 08:58:01,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834677588] [2019-10-22 08:58:01,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,391 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:01,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-10-22 08:58:01,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992505696] [2019-10-22 08:58:01,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,436 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:01,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-10-22 08:58:01,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908161635] [2019-10-22 08:58:01,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:01,933 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 08:58:01,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908161635] [2019-10-22 08:58:01,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:01,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:58:01,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297321413] [2019-10-22 08:58:02,797 WARN L191 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-10-22 08:58:02,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:02,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:58:02,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:58:02,879 INFO L87 Difference]: Start difference. First operand 1418 states and 1541 transitions. cyclomatic complexity: 128 Second operand 9 states. [2019-10-22 08:58:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:03,385 INFO L93 Difference]: Finished difference Result 1330 states and 1452 transitions. [2019-10-22 08:58:03,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:58:03,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 1452 transitions. [2019-10-22 08:58:03,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-10-22 08:58:03,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-10-22 08:58:03,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2019-10-22 08:58:03,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2019-10-22 08:58:03,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 1452 transitions. [2019-10-22 08:58:03,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:03,398 INFO L688 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 08:58:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 1452 transitions. [2019-10-22 08:58:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2019-10-22 08:58:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-22 08:58:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-10-22 08:58:03,414 INFO L711 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 08:58:03,414 INFO L591 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 08:58:03,414 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:58:03,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1452 transitions. [2019-10-22 08:58:03,418 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-10-22 08:58:03,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:03,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:03,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:03,419 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:03,419 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 08:58:03,419 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 08:58:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-10-22 08:58:03,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622799933] [2019-10-22 08:58:03,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,427 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-10-22 08:58:03,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818098129] [2019-10-22 08:58:03,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,434 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:03,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-10-22 08:58:03,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215475862] [2019-10-22 08:58:03,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,443 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:03,640 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:03,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:03,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:03,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:03,641 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:03,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:03,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:03,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:03,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59.c_Iteration12_Lasso [2019-10-22 08:58:03,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:03,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:03,643 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 08:58:03,657 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 08:58:03,659 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 08:58:03,661 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 08:58:03,663 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 08:58:03,666 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 08:58:03,669 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 08:58:03,671 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 08:58:03,674 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 08:58:03,677 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 08:58:03,679 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 08:58:03,681 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 08:58:03,684 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 08:58:03,686 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 08:58:03,690 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 08:58:03,692 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 08:58:03,704 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 08:58:03,707 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 08:58:03,710 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 08:58:03,718 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 08:58:03,721 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 08:58:03,918 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:03,918 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:03,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,924 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,924 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:03,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,930 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,930 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:03,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,936 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,938 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,938 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_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:03,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,945 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,946 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_3c2299fb-028d-4df8-922f-61d33570361c/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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:03,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,953 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,953 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:03,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,960 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_3c2299fb-028d-4df8-922f-61d33570361c/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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:03,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,971 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,972 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_3c2299fb-028d-4df8-922f-61d33570361c/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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:03,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,979 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,979 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:03,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,991 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,993 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:03,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:03,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:03,999 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:03,999 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_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:04,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,012 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:04,015 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,015 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_3c2299fb-028d-4df8-922f-61d33570361c/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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:04,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,021 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,022 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,028 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,036 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,036 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,043 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,043 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,047 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:04,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,243 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,243 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,256 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,262 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,262 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,266 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:04,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,371 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,400 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,400 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_3c2299fb-028d-4df8-922f-61d33570361c/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 08:58:04,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:04,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:04,408 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:04,408 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 08:58:04,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:04 BoogieIcfgContainer [2019-10-22 08:58:04,436 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:04,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:04,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:04,436 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:04,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51" (3/4) ... [2019-10-22 08:58:04,440 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:58:04,485 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3c2299fb-028d-4df8-922f-61d33570361c/bin/uautomizer/witness.graphml [2019-10-22 08:58:04,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:04,486 INFO L168 Benchmark]: Toolchain (without parser) took 14447.89 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 526.9 MB). Free memory was 940.6 MB in the beginning and 1.5 GB in the end (delta: -534.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:04,487 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:04,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:04,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.56 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 08:58:04,488 INFO L168 Benchmark]: Boogie Preprocessor took 42.07 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 08:58:04,488 INFO L168 Benchmark]: RCFGBuilder took 1043.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:04,488 INFO L168 Benchmark]: BuchiAutomizer took 12623.73 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 377.5 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -467.5 MB). Peak memory consumption was 429.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:04,489 INFO L168 Benchmark]: Witness Printer took 49.08 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:04,491 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 629.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.56 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 42.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1043.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12623.73 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 377.5 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -467.5 MB). Peak memory consumption was 429.4 MB. Max. memory is 11.5 GB. * Witness Printer took 49.08 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 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.5s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 6.7s. Construction of modules took 3.7s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1975 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2130 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1503 SDtfs, 1791 SDslu, 175 SDs, 0 SdLazy, 4260 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time LassoAnalysisResults: nont1 unkn0 SFLI8 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 144ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e09204d=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dba68a8=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@3e09204d=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dba68a8=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@3e09204d=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@dba68a8=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...