./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.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/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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 d8f19e5f85495da246f7b055515ad1966fa98828 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-11-15 20:54:13,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:54:13,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:54:13,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:54:13,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:54:13,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:54:13,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:54:13,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:54:13,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:54:13,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:54:13,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:54:13,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:54:13,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:54:13,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:54:13,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:54:13,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:54:13,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:54:13,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:54:13,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:54:13,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:54:13,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:54:13,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:54:13,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:54:13,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:54:13,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:54:13,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:54:13,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:54:13,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:54:13,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:54:13,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:54:13,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:54:13,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:54:13,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:54:13,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:54:13,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:54:13,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:54:13,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:54:13,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:54:13,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:54:13,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:54:13,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:54:13,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:54:13,154 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:54:13,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:54:13,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:54:13,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:54:13,168 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:54:13,168 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:54:13,168 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:54:13,169 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:54:13,169 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:54:13,169 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:54:13,170 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:54:13,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:54:13,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:54:13,170 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:54:13,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:54:13,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:54:13,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:54:13,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:54:13,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:54:13,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:54:13,173 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:54:13,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:54:13,174 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:54:13,175 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:54:13,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:54:13,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:54:13,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:54:13,176 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:54:13,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:54:13,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:54:13,178 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:54:13,179 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:54:13,179 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/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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 -> d8f19e5f85495da246f7b055515ad1966fa98828 [2019-11-15 20:54:13,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:54:13,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:54:13,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:54:13,242 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:54:13,242 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:54:13,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-15 20:54:13,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/data/733ff41bf/d66b59dac32648b2b962abf0c8919790/FLAG5f5567644 [2019-11-15 20:54:13,694 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:54:13,695 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-15 20:54:13,703 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/data/733ff41bf/d66b59dac32648b2b962abf0c8919790/FLAG5f5567644 [2019-11-15 20:54:13,717 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/data/733ff41bf/d66b59dac32648b2b962abf0c8919790 [2019-11-15 20:54:13,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:54:13,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:54:13,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:13,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:54:13,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:54:13,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:13" (1/1) ... [2019-11-15 20:54:13,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48805723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:13, skipping insertion in model container [2019-11-15 20:54:13,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:54:13" (1/1) ... [2019-11-15 20:54:13,740 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:54:13,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:54:14,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:14,025 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:54:14,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:54:14,060 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:54:14,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14 WrapperNode [2019-11-15 20:54:14,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:54:14,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:14,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:54:14,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:54:14,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:54:14,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:54:14,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:54:14,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:54:14,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... [2019-11-15 20:54:14,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:54:14,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:54:14,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:54:14,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:54:14,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:54:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:54:14,594 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:54:14,594 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 20:54:14,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:14 BoogieIcfgContainer [2019-11-15 20:54:14,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:54:14,596 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:54:14,596 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:54:14,599 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:54:14,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:54:14,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:54:13" (1/3) ... [2019-11-15 20:54:14,601 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@637b7502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:54:14, skipping insertion in model container [2019-11-15 20:54:14,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:54:14,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:54:14" (2/3) ... [2019-11-15 20:54:14,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@637b7502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:54:14, skipping insertion in model container [2019-11-15 20:54:14,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:54:14,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:14" (3/3) ... [2019-11-15 20:54:14,603 INFO L371 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-11-15 20:54:14,651 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:54:14,652 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:54:14,652 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:54:14,655 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:54:14,655 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:54:14,655 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:54:14,655 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:54:14,656 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:54:14,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-15 20:54:14,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-15 20:54:14,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:14,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:14,704 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:54:14,704 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:54:14,704 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:54:14,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-15 20:54:14,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-15 20:54:14,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:14,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:14,709 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:54:14,709 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 20:54:14,716 INFO L791 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 25#L176true [2019-11-15 20:54:14,716 INFO L793 eck$LassoCheckResult]: Loop: 25#L176true assume !false; 15#L23true assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7#L29true assume 8466 == main_~s__state~0; 32#L30true assume !(0 == main_~blastFlag~0); 18#L78-1true main_~s__state~0 := 8496; 25#L176true [2019-11-15 20:54:14,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 20:54:14,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:14,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630250743] [2019-11-15 20:54:14,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:14,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:14,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:14,807 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash 38331118, now seen corresponding path program 1 times [2019-11-15 20:54:14,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:14,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466650204] [2019-11-15 20:54:14,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:14,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:14,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:14,821 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:14,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:14,823 INFO L82 PathProgramCache]: Analyzing trace with hash 925834799, now seen corresponding path program 1 times [2019-11-15 20:54:14,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:14,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693964780] [2019-11-15 20:54:14,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:14,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:14,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:14,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693964780] [2019-11-15 20:54:14,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:14,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:54:14,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541196397] [2019-11-15 20:54:14,958 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:14,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:14,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:14,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:14,960 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:54:14,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:14,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:14,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:14,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration1_Loop [2019-11-15 20:54:14,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:14,960 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:14,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:14,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:15,110 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:15,112 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:15,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:15,129 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:15,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:54:15,161 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-11-15 20:54:15,176 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:54:15,179 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:15,179 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:15,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:15,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:15,180 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:15,180 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:15,180 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:15,180 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:15,180 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration1_Loop [2019-11-15 20:54:15,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:15,181 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:15,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:15,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:15,279 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:15,283 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:15,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:15,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:15,287 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:15,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:15,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:15,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:15,290 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:15,290 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:15,303 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:15,315 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:54:15,315 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:54:15,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:15,317 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:54:15,318 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:15,319 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8481 Supporting invariants [] [2019-11-15 20:54:15,321 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:54:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:15,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:15,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:15,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:15,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:15,425 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:54:15,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 4 states. [2019-11-15 20:54:15,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states.. Second operand 4 states. Result 134 states and 204 transitions. Complement of second has 8 states. [2019-11-15 20:54:15,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:54:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2019-11-15 20:54:15,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 1 letters. Loop has 5 letters. [2019-11-15 20:54:15,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:15,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-15 20:54:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:15,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 1 letters. Loop has 10 letters. [2019-11-15 20:54:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:15,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 204 transitions. [2019-11-15 20:54:15,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-15 20:54:15,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 80 states and 127 transitions. [2019-11-15 20:54:15,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-11-15 20:54:15,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-15 20:54:15,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 127 transitions. [2019-11-15 20:54:15,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:15,819 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 127 transitions. [2019-11-15 20:54:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 127 transitions. [2019-11-15 20:54:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 47. [2019-11-15 20:54:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 20:54:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2019-11-15 20:54:15,848 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2019-11-15 20:54:15,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:15,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:15,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:15,852 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2019-11-15 20:54:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:15,903 INFO L93 Difference]: Finished difference Result 89 states and 133 transitions. [2019-11-15 20:54:15,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:15,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 133 transitions. [2019-11-15 20:54:15,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2019-11-15 20:54:15,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 133 transitions. [2019-11-15 20:54:15,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2019-11-15 20:54:15,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2019-11-15 20:54:15,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 133 transitions. [2019-11-15 20:54:15,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:15,909 INFO L688 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-11-15 20:54:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 133 transitions. [2019-11-15 20:54:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-15 20:54:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 20:54:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2019-11-15 20:54:15,916 INFO L711 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-11-15 20:54:15,916 INFO L591 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-11-15 20:54:15,916 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:54:15,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 133 transitions. [2019-11-15 20:54:15,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2019-11-15 20:54:15,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:15,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:15,919 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:54:15,919 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:54:15,919 INFO L791 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 395#L176 assume !false; 383#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 370#L29 assume !(8466 == main_~s__state~0); 371#L32 [2019-11-15 20:54:15,920 INFO L793 eck$LassoCheckResult]: Loop: 371#L32 assume 8496 == main_~s__state~0; 379#L33 assume !(1 == main_~blastFlag~0); 406#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 365#L176 assume !false; 450#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 449#L29 assume !(8466 == main_~s__state~0); 371#L32 [2019-11-15 20:54:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash 963407, now seen corresponding path program 1 times [2019-11-15 20:54:15,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:15,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007146692] [2019-11-15 20:54:15,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:15,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:15,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:15,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007146692] [2019-11-15 20:54:15,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:15,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-15 20:54:15,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988505578] [2019-11-15 20:54:15,943 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1630948181, now seen corresponding path program 1 times [2019-11-15 20:54:15,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:15,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479392401] [2019-11-15 20:54:15,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:15,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:15,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:15,952 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:16,000 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:16,001 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:16,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:16,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:16,001 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:54:16,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:16,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:16,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:16,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration2_Loop [2019-11-15 20:54:16,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:16,001 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:16,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:16,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:16,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:16,063 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:16,063 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:16,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:16,067 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-11-15 20:54:16,075 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:54:16,075 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0=7} Honda state: {ULTIMATE.start_main_~s__hit~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:54:16,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:16,082 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:54:16,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:54:16,094 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:16,100 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:54:16,104 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:16,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:16,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:16,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:16,104 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:16,104 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:16,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:16,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:16,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration2_Loop [2019-11-15 20:54:16,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:16,105 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:16,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:16,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:16,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:16,174 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:16,174 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:16,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:16,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:16,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:16,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:16,176 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:54:16,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:16,177 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:54:16,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:16,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:16,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:16,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:16,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:16,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:16,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:16,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:16,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:16,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:16,193 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:16,199 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:54:16,199 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:54:16,200 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:16,200 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:54:16,200 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:16,200 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8576 Supporting invariants [] [2019-11-15 20:54:16,201 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:54:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:16,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:16,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:16,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:16,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:16,258 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:54:16,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 133 transitions. cyclomatic complexity: 47 Second operand 4 states. [2019-11-15 20:54:16,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 133 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 288 states and 419 transitions. Complement of second has 7 states. [2019-11-15 20:54:16,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:54:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2019-11-15 20:54:16,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 20:54:16,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:16,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 20:54:16,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:16,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-15 20:54:16,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:16,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 419 transitions. [2019-11-15 20:54:16,532 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2019-11-15 20:54:16,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 211 states and 320 transitions. [2019-11-15 20:54:16,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2019-11-15 20:54:16,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-11-15 20:54:16,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 320 transitions. [2019-11-15 20:54:16,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:16,537 INFO L688 BuchiCegarLoop]: Abstraction has 211 states and 320 transitions. [2019-11-15 20:54:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 320 transitions. [2019-11-15 20:54:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2019-11-15 20:54:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 20:54:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2019-11-15 20:54:16,547 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 181 transitions. [2019-11-15 20:54:16,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:16,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:16,548 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand 3 states. [2019-11-15 20:54:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:16,623 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2019-11-15 20:54:16,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:16,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 111 transitions. [2019-11-15 20:54:16,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-15 20:54:16,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 74 states and 109 transitions. [2019-11-15 20:54:16,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-15 20:54:16,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-15 20:54:16,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 109 transitions. [2019-11-15 20:54:16,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:16,627 INFO L688 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-15 20:54:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 109 transitions. [2019-11-15 20:54:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-15 20:54:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 20:54:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-11-15 20:54:16,637 INFO L711 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-15 20:54:16,638 INFO L591 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-15 20:54:16,638 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:54:16,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 109 transitions. [2019-11-15 20:54:16,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-15 20:54:16,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:16,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:16,642 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:16,642 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:54:16,642 INFO L791 eck$LassoCheckResult]: Stem: 1040#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 1041#L176 assume !false; 1059#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1057#L29 assume 8466 == main_~s__state~0; 1056#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 1053#L78-1 main_~s__state~0 := 8496; 1051#L176 assume !false; 1049#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1046#L29 assume !(8466 == main_~s__state~0); 1044#L32 assume !(8496 == main_~s__state~0); 1013#L36 [2019-11-15 20:54:16,643 INFO L793 eck$LassoCheckResult]: Loop: 1013#L36 assume 8512 == main_~s__state~0; 1028#L37 main_~s__state~0 := 8528; 995#L176 assume !false; 1050#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1047#L29 assume !(8466 == main_~s__state~0); 1045#L32 assume !(8496 == main_~s__state~0); 1013#L36 [2019-11-15 20:54:16,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1381923845, now seen corresponding path program 1 times [2019-11-15 20:54:16,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:16,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433756307] [2019-11-15 20:54:16,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:16,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:16,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:16,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433756307] [2019-11-15 20:54:16,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:16,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:54:16,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634271562] [2019-11-15 20:54:16,696 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:16,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1779937937, now seen corresponding path program 1 times [2019-11-15 20:54:16,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:16,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073553925] [2019-11-15 20:54:16,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:16,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:16,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:16,715 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:16,734 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:16,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:16,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:16,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:16,735 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:54:16,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:16,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:16,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:16,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration3_Loop [2019-11-15 20:54:16,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:16,736 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:16,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:16,764 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:16,764 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:54:16,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:16,781 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:16,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:54:16,806 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-11-15 20:54:16,814 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:54:16,818 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:16,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:16,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:16,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:16,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:16,819 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:16,819 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:16,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:16,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration3_Loop [2019-11-15 20:54:16,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:16,819 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:16,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:16,870 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:16,870 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:16,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:16,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:16,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:16,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:16,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:16,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:16,873 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:16,873 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:16,887 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:16,894 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:54:16,902 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:54:16,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:16,904 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:54:16,904 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:16,904 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8520 Supporting invariants [] [2019-11-15 20:54:16,905 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:54:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:16,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:16,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:16,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:16,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:16,981 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:54:16,982 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 109 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-11-15 20:54:17,305 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 109 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 232 states and 347 transitions. Complement of second has 9 states. [2019-11-15 20:54:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:54:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2019-11-15 20:54:17,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 20:54:17,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:17,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-15 20:54:17,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:17,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-15 20:54:17,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:17,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 347 transitions. [2019-11-15 20:54:17,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2019-11-15 20:54:17,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 182 states and 281 transitions. [2019-11-15 20:54:17,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-11-15 20:54:17,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2019-11-15 20:54:17,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 281 transitions. [2019-11-15 20:54:17,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:17,315 INFO L688 BuchiCegarLoop]: Abstraction has 182 states and 281 transitions. [2019-11-15 20:54:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 281 transitions. [2019-11-15 20:54:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 102. [2019-11-15 20:54:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 20:54:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2019-11-15 20:54:17,322 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 152 transitions. [2019-11-15 20:54:17,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:17,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:17,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:17,323 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand 3 states. [2019-11-15 20:54:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:17,388 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2019-11-15 20:54:17,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:17,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 157 transitions. [2019-11-15 20:54:17,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-15 20:54:17,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 149 transitions. [2019-11-15 20:54:17,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-11-15 20:54:17,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-15 20:54:17,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 149 transitions. [2019-11-15 20:54:17,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:17,392 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 149 transitions. [2019-11-15 20:54:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 149 transitions. [2019-11-15 20:54:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-15 20:54:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 20:54:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2019-11-15 20:54:17,398 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-11-15 20:54:17,398 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-11-15 20:54:17,398 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:54:17,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 147 transitions. [2019-11-15 20:54:17,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2019-11-15 20:54:17,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:17,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:17,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:17,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:17,400 INFO L791 eck$LassoCheckResult]: Stem: 1644#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 1645#L176 assume !false; 1680#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1678#L29 assume 8466 == main_~s__state~0; 1677#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 1676#L78-1 main_~s__state~0 := 8496; 1674#L176 assume !false; 1671#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1669#L29 assume !(8466 == main_~s__state~0); 1667#L32 assume 8496 == main_~s__state~0; 1665#L33 assume !(1 == main_~blastFlag~0); 1664#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 1661#L176 assume !false; 1659#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1657#L29 assume !(8466 == main_~s__state~0); 1655#L32 assume !(8496 == main_~s__state~0); 1653#L36 assume !(8512 == main_~s__state~0); 1602#L40 [2019-11-15 20:54:17,400 INFO L793 eck$LassoCheckResult]: Loop: 1602#L40 assume 8528 == main_~s__state~0; 1603#L41 main_~s__state~0 := 8544; 1592#L176 assume !false; 1651#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1649#L29 assume !(8466 == main_~s__state~0); 1647#L32 assume !(8496 == main_~s__state~0); 1646#L36 assume !(8512 == main_~s__state~0); 1602#L40 [2019-11-15 20:54:17,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 905234773, now seen corresponding path program 1 times [2019-11-15 20:54:17,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:17,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231802987] [2019-11-15 20:54:17,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:17,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231802987] [2019-11-15 20:54:17,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:17,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:17,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653722023] [2019-11-15 20:54:17,426 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash -456689360, now seen corresponding path program 1 times [2019-11-15 20:54:17,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:17,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236291248] [2019-11-15 20:54:17,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:17,434 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:17,455 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:17,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:17,455 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:17,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:17,455 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:54:17,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:17,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:17,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:17,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration4_Loop [2019-11-15 20:54:17,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:17,456 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:17,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:17,489 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:17,489 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:54:17,496 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:17,496 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:17,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:54:17,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:54:17,535 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:54:17,538 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:17,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:17,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:17,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:17,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:17,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:17,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:17,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:17,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration4_Loop [2019-11-15 20:54:17,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:17,539 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:17,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:17,570 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:17,570 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:17,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:17,571 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:17,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:17,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:17,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:17,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:17,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:17,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:17,578 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:17,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:54:17,582 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:54:17,582 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:17,583 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:54:17,583 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:17,583 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8536 Supporting invariants [] [2019-11-15 20:54:17,584 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:54:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:17,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:17,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:17,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:17,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:17,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:54:17,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 147 transitions. cyclomatic complexity: 47 Second operand 4 states. [2019-11-15 20:54:17,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 147 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 271 states and 397 transitions. Complement of second has 9 states. [2019-11-15 20:54:17,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:54:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2019-11-15 20:54:17,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-15 20:54:17,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:17,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 24 letters. Loop has 7 letters. [2019-11-15 20:54:17,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:17,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 17 letters. Loop has 14 letters. [2019-11-15 20:54:17,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:17,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 397 transitions. [2019-11-15 20:54:17,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 80 [2019-11-15 20:54:17,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 225 states and 335 transitions. [2019-11-15 20:54:17,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-11-15 20:54:17,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-11-15 20:54:17,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 335 transitions. [2019-11-15 20:54:17,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:17,918 INFO L688 BuchiCegarLoop]: Abstraction has 225 states and 335 transitions. [2019-11-15 20:54:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 335 transitions. [2019-11-15 20:54:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2019-11-15 20:54:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 20:54:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2019-11-15 20:54:17,926 INFO L711 BuchiCegarLoop]: Abstraction has 146 states and 208 transitions. [2019-11-15 20:54:17,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:17,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:17,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:17,927 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand 3 states. [2019-11-15 20:54:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:17,949 INFO L93 Difference]: Finished difference Result 182 states and 244 transitions. [2019-11-15 20:54:17,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:17,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 244 transitions. [2019-11-15 20:54:17,951 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2019-11-15 20:54:17,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 244 transitions. [2019-11-15 20:54:17,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2019-11-15 20:54:17,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2019-11-15 20:54:17,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 244 transitions. [2019-11-15 20:54:17,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:17,954 INFO L688 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-11-15 20:54:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 244 transitions. [2019-11-15 20:54:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-11-15 20:54:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-15 20:54:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2019-11-15 20:54:17,961 INFO L711 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-11-15 20:54:17,961 INFO L591 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-11-15 20:54:17,961 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:54:17,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 244 transitions. [2019-11-15 20:54:17,962 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2019-11-15 20:54:17,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:17,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:17,963 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:17,963 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:17,964 INFO L791 eck$LassoCheckResult]: Stem: 2455#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 2456#L176 assume !false; 2569#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2567#L29 assume 8466 == main_~s__state~0; 2549#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 2548#L78-1 main_~s__state~0 := 8496; 2547#L176 assume !false; 2544#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2541#L29 assume !(8466 == main_~s__state~0); 2537#L32 assume 8496 == main_~s__state~0; 2415#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 2451#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 2452#L176 assume !false; 2533#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2530#L29 assume !(8466 == main_~s__state~0); 2529#L32 assume !(8496 == main_~s__state~0); 2527#L36 assume !(8512 == main_~s__state~0); 2459#L40 assume !(8528 == main_~s__state~0); 2406#L44 [2019-11-15 20:54:17,964 INFO L793 eck$LassoCheckResult]: Loop: 2406#L44 assume 8544 == main_~s__state~0; 2424#L45 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 2395#L176 assume !false; 2472#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2468#L29 assume !(8466 == main_~s__state~0); 2464#L32 assume !(8496 == main_~s__state~0); 2460#L36 assume !(8512 == main_~s__state~0); 2458#L40 assume !(8528 == main_~s__state~0); 2406#L44 [2019-11-15 20:54:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:17,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1193146448, now seen corresponding path program 1 times [2019-11-15 20:54:17,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:17,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404682970] [2019-11-15 20:54:17,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:54:17,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404682970] [2019-11-15 20:54:17,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:17,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:17,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345111839] [2019-11-15 20:54:17,982 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 594459181, now seen corresponding path program 1 times [2019-11-15 20:54:17,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:17,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418353944] [2019-11-15 20:54:17,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:17,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:17,989 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:18,024 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:18,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:18,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:18,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:18,025 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:54:18,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:18,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:18,025 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:18,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration5_Loop [2019-11-15 20:54:18,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:18,025 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:18,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:18,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:18,073 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:18,073 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:18,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:18,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:54:18,096 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:54:18,096 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__verify_mode~0=-1} Honda state: {ULTIMATE.start_main_~s__verify_mode~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:18,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:18,115 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:18,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:54:18,141 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-11-15 20:54:18,147 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:54:18,149 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:18,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:18,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:18,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:18,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:18,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:18,150 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:18,150 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:18,150 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration5_Loop [2019-11-15 20:54:18,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:18,151 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:18,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:18,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:18,198 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:18,198 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:18,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:18,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:18,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:18,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:18,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:18,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:18,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:18,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:18,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:54:18,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-11-15 20:54:18,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:18,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:18,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:18,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:18,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:18,205 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:18,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:18,210 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:18,213 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:54:18,213 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:54:18,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:18,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:54:18,214 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:18,214 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8552 Supporting invariants [] [2019-11-15 20:54:18,215 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:54:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:18,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:18,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:18,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:18,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:18,277 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:54:18,278 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 244 transitions. cyclomatic complexity: 68 Second operand 4 states. [2019-11-15 20:54:18,512 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 244 transitions. cyclomatic complexity: 68. Second operand 4 states. Result 363 states and 509 transitions. Complement of second has 9 states. [2019-11-15 20:54:18,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:54:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2019-11-15 20:54:18,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 18 letters. Loop has 8 letters. [2019-11-15 20:54:18,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:18,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 26 letters. Loop has 8 letters. [2019-11-15 20:54:18,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:18,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 18 letters. Loop has 16 letters. [2019-11-15 20:54:18,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:18,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 509 transitions. [2019-11-15 20:54:18,518 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 123 [2019-11-15 20:54:18,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 321 states and 451 transitions. [2019-11-15 20:54:18,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2019-11-15 20:54:18,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-11-15 20:54:18,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 451 transitions. [2019-11-15 20:54:18,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:18,521 INFO L688 BuchiCegarLoop]: Abstraction has 321 states and 451 transitions. [2019-11-15 20:54:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 451 transitions. [2019-11-15 20:54:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 247. [2019-11-15 20:54:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-15 20:54:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 337 transitions. [2019-11-15 20:54:18,528 INFO L711 BuchiCegarLoop]: Abstraction has 247 states and 337 transitions. [2019-11-15 20:54:18,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:18,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:18,529 INFO L87 Difference]: Start difference. First operand 247 states and 337 transitions. Second operand 3 states. [2019-11-15 20:54:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:18,592 INFO L93 Difference]: Finished difference Result 281 states and 366 transitions. [2019-11-15 20:54:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:18,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 366 transitions. [2019-11-15 20:54:18,595 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 108 [2019-11-15 20:54:18,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 260 states and 342 transitions. [2019-11-15 20:54:18,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2019-11-15 20:54:18,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2019-11-15 20:54:18,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 342 transitions. [2019-11-15 20:54:18,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:18,598 INFO L688 BuchiCegarLoop]: Abstraction has 260 states and 342 transitions. [2019-11-15 20:54:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states and 342 transitions. [2019-11-15 20:54:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-11-15 20:54:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-15 20:54:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 340 transitions. [2019-11-15 20:54:18,604 INFO L711 BuchiCegarLoop]: Abstraction has 258 states and 340 transitions. [2019-11-15 20:54:18,604 INFO L591 BuchiCegarLoop]: Abstraction has 258 states and 340 transitions. [2019-11-15 20:54:18,604 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:54:18,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 340 transitions. [2019-11-15 20:54:18,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 107 [2019-11-15 20:54:18,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:18,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:18,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:18,608 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:18,608 INFO L791 eck$LassoCheckResult]: Stem: 3639#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 3640#L176 assume !false; 3764#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3762#L29 assume 8466 == main_~s__state~0; 3761#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 3760#L78-1 main_~s__state~0 := 8496; 3759#L176 assume !false; 3754#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3748#L29 assume !(8466 == main_~s__state~0); 3737#L32 assume 8496 == main_~s__state~0; 3716#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 3712#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 3709#L176 assume !false; 3707#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3705#L29 assume !(8466 == main_~s__state~0); 3703#L32 assume !(8496 == main_~s__state~0); 3701#L36 assume !(8512 == main_~s__state~0); 3697#L40 assume !(8528 == main_~s__state~0); 3652#L44 assume !(8544 == main_~s__state~0); 3619#L48 [2019-11-15 20:54:18,608 INFO L793 eck$LassoCheckResult]: Loop: 3619#L48 assume 8560 == main_~s__state~0; 3573#L49 main_~s__state~0 := 8576; 3574#L176 assume !false; 3662#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3658#L29 assume !(8466 == main_~s__state~0); 3655#L32 assume !(8496 == main_~s__state~0); 3650#L36 assume !(8512 == main_~s__state~0); 3648#L40 assume !(8528 == main_~s__state~0); 3647#L44 assume !(8544 == main_~s__state~0); 3619#L48 [2019-11-15 20:54:18,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:18,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1818454854, now seen corresponding path program 1 times [2019-11-15 20:54:18,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:18,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779923477] [2019-11-15 20:54:18,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:18,621 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1734491453, now seen corresponding path program 1 times [2019-11-15 20:54:18,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:18,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920871050] [2019-11-15 20:54:18,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:18,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:18,629 INFO L82 PathProgramCache]: Analyzing trace with hash 566159524, now seen corresponding path program 1 times [2019-11-15 20:54:18,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:18,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804622084] [2019-11-15 20:54:18,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:18,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:54:18,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804622084] [2019-11-15 20:54:18,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:18,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:18,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000885219] [2019-11-15 20:54:18,677 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:18,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:18,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:18,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:18,677 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:54:18,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:18,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:18,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:18,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration6_Loop [2019-11-15 20:54:18,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:18,678 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:18,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:18,699 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:18,699 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:18,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:18,711 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:54:18,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:54:18,741 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:18,747 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:54:18,750 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:18,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:18,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:18,750 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:18,750 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:18,750 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:18,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:18,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:18,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration6_Loop [2019-11-15 20:54:18,751 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:18,751 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:18,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:18,787 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:18,787 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:18,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:18,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:18,788 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:18,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:18,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:18,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:18,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:18,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:18,793 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:18,796 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:54:18,796 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:54:18,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:18,797 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:54:18,797 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:18,797 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8568 Supporting invariants [] [2019-11-15 20:54:18,798 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:54:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:18,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:18,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:18,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:18,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:18,862 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:54:18,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 258 states and 340 transitions. cyclomatic complexity: 89 Second operand 4 states. [2019-11-15 20:54:19,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 258 states and 340 transitions. cyclomatic complexity: 89. Second operand 4 states. Result 460 states and 639 transitions. Complement of second has 9 states. [2019-11-15 20:54:19,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:54:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2019-11-15 20:54:19,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 19 letters. Loop has 9 letters. [2019-11-15 20:54:19,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:19,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 28 letters. Loop has 9 letters. [2019-11-15 20:54:19,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:19,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 19 letters. Loop has 18 letters. [2019-11-15 20:54:19,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:19,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 639 transitions. [2019-11-15 20:54:19,098 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 159 [2019-11-15 20:54:19,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 425 states and 589 transitions. [2019-11-15 20:54:19,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-11-15 20:54:19,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2019-11-15 20:54:19,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 425 states and 589 transitions. [2019-11-15 20:54:19,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:19,103 INFO L688 BuchiCegarLoop]: Abstraction has 425 states and 589 transitions. [2019-11-15 20:54:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states and 589 transitions. [2019-11-15 20:54:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 343. [2019-11-15 20:54:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-15 20:54:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 460 transitions. [2019-11-15 20:54:19,115 INFO L711 BuchiCegarLoop]: Abstraction has 343 states and 460 transitions. [2019-11-15 20:54:19,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:19,116 INFO L87 Difference]: Start difference. First operand 343 states and 460 transitions. Second operand 3 states. [2019-11-15 20:54:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:19,211 INFO L93 Difference]: Finished difference Result 397 states and 510 transitions. [2019-11-15 20:54:19,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:19,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 510 transitions. [2019-11-15 20:54:19,215 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 154 [2019-11-15 20:54:19,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 372 states and 485 transitions. [2019-11-15 20:54:19,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-11-15 20:54:19,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2019-11-15 20:54:19,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 485 transitions. [2019-11-15 20:54:19,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:19,219 INFO L688 BuchiCegarLoop]: Abstraction has 372 states and 485 transitions. [2019-11-15 20:54:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 485 transitions. [2019-11-15 20:54:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 336. [2019-11-15 20:54:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-15 20:54:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 448 transitions. [2019-11-15 20:54:19,242 INFO L711 BuchiCegarLoop]: Abstraction has 336 states and 448 transitions. [2019-11-15 20:54:19,242 INFO L591 BuchiCegarLoop]: Abstraction has 336 states and 448 transitions. [2019-11-15 20:54:19,242 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:54:19,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 336 states and 448 transitions. [2019-11-15 20:54:19,245 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 152 [2019-11-15 20:54:19,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:19,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:19,249 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,249 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,249 INFO L791 eck$LassoCheckResult]: Stem: 5214#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 5215#L176 assume !false; 5462#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5459#L29 assume 8466 == main_~s__state~0; 5200#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 5201#L78-1 main_~s__state~0 := 8496; 5475#L176 assume !false; 5473#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5471#L29 assume !(8466 == main_~s__state~0); 5469#L32 assume 8496 == main_~s__state~0; 5217#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 5209#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 5168#L176 [2019-11-15 20:54:19,249 INFO L793 eck$LassoCheckResult]: Loop: 5168#L176 assume !false; 5170#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5153#L29 assume !(8466 == main_~s__state~0); 5154#L32 assume !(8496 == main_~s__state~0); 5164#L36 assume !(8512 == main_~s__state~0); 5157#L40 assume !(8528 == main_~s__state~0); 5158#L44 assume !(8544 == main_~s__state~0); 5191#L48 assume !(8560 == main_~s__state~0); 5192#L52 assume !(8576 == main_~s__state~0); 5185#L56 assume !(8592 == main_~s__state~0); 5149#L60 assume !(8608 == main_~s__state~0); 5150#L64 assume !(8640 == main_~s__state~0); 5216#L68 assume 8656 == main_~s__state~0; 5143#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 5144#L162-1 main_~s__state~0 := 8672; 5168#L176 [2019-11-15 20:54:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash -883919713, now seen corresponding path program 1 times [2019-11-15 20:54:19,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768419192] [2019-11-15 20:54:19,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:19,265 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash -15441655, now seen corresponding path program 1 times [2019-11-15 20:54:19,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839065199] [2019-11-15 20:54:19,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:19,285 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2052349099, now seen corresponding path program 1 times [2019-11-15 20:54:19,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560635496] [2019-11-15 20:54:19,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:19,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:19,360 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:19,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:19,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:19,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:19,360 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:54:19,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:19,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:19,360 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:19,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration7_Loop [2019-11-15 20:54:19,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:19,361 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:19,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:19,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:19,413 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:19,413 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:19,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:19,424 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/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:19,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:54:19,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:54:19,439 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:54:19,441 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:19,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:19,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:19,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:19,442 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:19,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:19,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:19,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:19,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration7_Loop [2019-11-15 20:54:19,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:19,442 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:19,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:19,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:19,504 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:19,504 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:19,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:19,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:19,505 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:19,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:19,506 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:19,506 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:19,507 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:19,507 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:19,511 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:19,513 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:54:19,513 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:54:19,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:19,514 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:54:19,514 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:19,514 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8664 Supporting invariants [] [2019-11-15 20:54:19,514 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:54:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:19,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:19,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:19,577 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:54:19,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 336 states and 448 transitions. cyclomatic complexity: 120 Second operand 4 states. [2019-11-15 20:54:19,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 336 states and 448 transitions. cyclomatic complexity: 120. Second operand 4 states. Result 442 states and 583 transitions. Complement of second has 7 states. [2019-11-15 20:54:19,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:54:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2019-11-15 20:54:19,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 12 letters. Loop has 15 letters. [2019-11-15 20:54:19,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:19,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 27 letters. Loop has 15 letters. [2019-11-15 20:54:19,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:19,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 12 letters. Loop has 30 letters. [2019-11-15 20:54:19,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:19,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 583 transitions. [2019-11-15 20:54:19,641 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 220 [2019-11-15 20:54:19,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 436 states and 575 transitions. [2019-11-15 20:54:19,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2019-11-15 20:54:19,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2019-11-15 20:54:19,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 575 transitions. [2019-11-15 20:54:19,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:19,645 INFO L688 BuchiCegarLoop]: Abstraction has 436 states and 575 transitions. [2019-11-15 20:54:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 575 transitions. [2019-11-15 20:54:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-11-15 20:54:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-15 20:54:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 570 transitions. [2019-11-15 20:54:19,654 INFO L711 BuchiCegarLoop]: Abstraction has 432 states and 570 transitions. [2019-11-15 20:54:19,655 INFO L591 BuchiCegarLoop]: Abstraction has 432 states and 570 transitions. [2019-11-15 20:54:19,655 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:54:19,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 432 states and 570 transitions. [2019-11-15 20:54:19,657 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 220 [2019-11-15 20:54:19,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:19,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:19,659 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,659 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,659 INFO L791 eck$LassoCheckResult]: Stem: 6109#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 6110#L176 assume !false; 6303#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6302#L29 assume 8466 == main_~s__state~0; 6301#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 6300#L78-1 main_~s__state~0 := 8496; 6256#L176 assume !false; 6253#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6250#L29 assume !(8466 == main_~s__state~0); 6248#L32 assume 8496 == main_~s__state~0; 6246#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 6244#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 6104#L176 assume !false; 6247#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6245#L29 assume !(8466 == main_~s__state~0); 6243#L32 assume !(8496 == main_~s__state~0); 6241#L36 assume !(8512 == main_~s__state~0); 6238#L40 assume !(8528 == main_~s__state~0); 6235#L44 assume !(8544 == main_~s__state~0); 6230#L48 assume !(8560 == main_~s__state~0); 6227#L52 assume !(8576 == main_~s__state~0); 6222#L56 assume !(8592 == main_~s__state~0); 6219#L60 assume !(8608 == main_~s__state~0); 6111#L64 assume !(8640 == main_~s__state~0); 6112#L68 assume !(8656 == main_~s__state~0); 6091#L72 [2019-11-15 20:54:19,659 INFO L793 eck$LassoCheckResult]: Loop: 6091#L72 assume 8672 == main_~s__state~0; 6050#L73 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 6051#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 6032#L176 assume !false; 6335#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6333#L29 assume !(8466 == main_~s__state~0); 6328#L32 assume !(8496 == main_~s__state~0); 6323#L36 assume !(8512 == main_~s__state~0); 6318#L40 assume !(8528 == main_~s__state~0); 6271#L44 assume !(8544 == main_~s__state~0); 6272#L48 assume !(8560 == main_~s__state~0); 6284#L52 assume !(8576 == main_~s__state~0); 6135#L56 assume !(8592 == main_~s__state~0); 6035#L60 assume !(8608 == main_~s__state~0); 6037#L64 assume !(8640 == main_~s__state~0); 6182#L68 assume !(8656 == main_~s__state~0); 6091#L72 [2019-11-15 20:54:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1204368937, now seen corresponding path program 1 times [2019-11-15 20:54:19,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123947131] [2019-11-15 20:54:19,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:54:19,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123947131] [2019-11-15 20:54:19,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:19,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:54:19,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364104849] [2019-11-15 20:54:19,699 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1774399381, now seen corresponding path program 1 times [2019-11-15 20:54:19,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581918010] [2019-11-15 20:54:19,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:19,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581918010] [2019-11-15 20:54:19,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:19,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:19,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792328046] [2019-11-15 20:54:19,721 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:54:19,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:19,721 INFO L87 Difference]: Start difference. First operand 432 states and 570 transitions. cyclomatic complexity: 148 Second operand 3 states. [2019-11-15 20:54:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:19,793 INFO L93 Difference]: Finished difference Result 409 states and 528 transitions. [2019-11-15 20:54:19,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:19,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 528 transitions. [2019-11-15 20:54:19,796 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 194 [2019-11-15 20:54:19,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 528 transitions. [2019-11-15 20:54:19,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2019-11-15 20:54:19,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2019-11-15 20:54:19,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 528 transitions. [2019-11-15 20:54:19,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:19,800 INFO L688 BuchiCegarLoop]: Abstraction has 409 states and 528 transitions. [2019-11-15 20:54:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 528 transitions. [2019-11-15 20:54:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 376. [2019-11-15 20:54:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-15 20:54:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 491 transitions. [2019-11-15 20:54:19,807 INFO L711 BuchiCegarLoop]: Abstraction has 376 states and 491 transitions. [2019-11-15 20:54:19,808 INFO L591 BuchiCegarLoop]: Abstraction has 376 states and 491 transitions. [2019-11-15 20:54:19,808 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:54:19,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 376 states and 491 transitions. [2019-11-15 20:54:19,810 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 161 [2019-11-15 20:54:19,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:19,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:19,811 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,811 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,812 INFO L791 eck$LassoCheckResult]: Stem: 6955#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 6956#L176 assume !false; 7168#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7148#L29 assume 8466 == main_~s__state~0; 7147#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 7146#L78-1 main_~s__state~0 := 8496; 7145#L176 assume !false; 7144#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7143#L29 assume !(8466 == main_~s__state~0); 7141#L32 assume 8496 == main_~s__state~0; 7139#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 7136#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 6953#L176 assume !false; 7134#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7243#L29 assume !(8466 == main_~s__state~0); 7242#L32 assume !(8496 == main_~s__state~0); 7241#L36 assume !(8512 == main_~s__state~0); 7240#L40 assume !(8528 == main_~s__state~0); 7239#L44 assume !(8544 == main_~s__state~0); 7237#L48 assume !(8560 == main_~s__state~0); 7235#L52 assume !(8576 == main_~s__state~0); 7234#L56 assume !(8592 == main_~s__state~0); 7233#L60 assume !(8608 == main_~s__state~0); 6957#L64 assume !(8640 == main_~s__state~0); 6958#L68 assume !(8656 == main_~s__state~0); 6940#L72 [2019-11-15 20:54:19,812 INFO L793 eck$LassoCheckResult]: Loop: 6940#L72 assume 8672 == main_~s__state~0; 6897#L73 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 6898#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 6928#L176 assume !false; 6907#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6889#L29 assume !(8466 == main_~s__state~0); 6890#L32 assume !(8496 == main_~s__state~0); 7248#L36 assume !(8512 == main_~s__state~0); 7247#L40 assume !(8528 == main_~s__state~0); 7246#L44 assume !(8544 == main_~s__state~0); 6930#L48 assume !(8560 == main_~s__state~0); 6931#L52 assume !(8576 == main_~s__state~0); 6919#L56 assume !(8592 == main_~s__state~0); 6920#L60 assume !(8608 == main_~s__state~0); 7149#L64 assume 8640 == main_~s__state~0; 6906#L65 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 6903#L151-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 6904#L176 assume !false; 7250#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7249#L29 assume !(8466 == main_~s__state~0); 6900#L32 assume !(8496 == main_~s__state~0); 6901#L36 assume !(8512 == main_~s__state~0); 6893#L40 assume !(8528 == main_~s__state~0); 6894#L44 assume !(8544 == main_~s__state~0); 6962#L48 assume !(8560 == main_~s__state~0); 7245#L52 assume !(8576 == main_~s__state~0); 7244#L56 assume !(8592 == main_~s__state~0); 6883#L60 assume !(8608 == main_~s__state~0); 6884#L64 assume !(8640 == main_~s__state~0); 7232#L68 assume !(8656 == main_~s__state~0); 6940#L72 [2019-11-15 20:54:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1204368937, now seen corresponding path program 2 times [2019-11-15 20:54:19,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419275784] [2019-11-15 20:54:19,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:54:19,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419275784] [2019-11-15 20:54:19,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:19,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:54:19,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838965806] [2019-11-15 20:54:19,828 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1325834225, now seen corresponding path program 1 times [2019-11-15 20:54:19,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108479740] [2019-11-15 20:54:19,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:19,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108479740] [2019-11-15 20:54:19,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:19,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:19,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272878405] [2019-11-15 20:54:19,847 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:54:19,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:19,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:19,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:19,847 INFO L87 Difference]: Start difference. First operand 376 states and 491 transitions. cyclomatic complexity: 125 Second operand 3 states. [2019-11-15 20:54:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:19,911 INFO L93 Difference]: Finished difference Result 413 states and 527 transitions. [2019-11-15 20:54:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:19,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 527 transitions. [2019-11-15 20:54:19,916 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2019-11-15 20:54:19,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 401 states and 515 transitions. [2019-11-15 20:54:19,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2019-11-15 20:54:19,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2019-11-15 20:54:19,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 515 transitions. [2019-11-15 20:54:19,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:19,920 INFO L688 BuchiCegarLoop]: Abstraction has 401 states and 515 transitions. [2019-11-15 20:54:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 515 transitions. [2019-11-15 20:54:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2019-11-15 20:54:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-15 20:54:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 503 transitions. [2019-11-15 20:54:19,928 INFO L711 BuchiCegarLoop]: Abstraction has 389 states and 503 transitions. [2019-11-15 20:54:19,928 INFO L591 BuchiCegarLoop]: Abstraction has 389 states and 503 transitions. [2019-11-15 20:54:19,928 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 20:54:19,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 389 states and 503 transitions. [2019-11-15 20:54:19,930 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2019-11-15 20:54:19,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:19,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:19,932 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,932 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:19,932 INFO L791 eck$LassoCheckResult]: Stem: 7754#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 7755#L176 assume !false; 7966#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7965#L29 assume 8466 == main_~s__state~0; 7964#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 7963#L78-1 main_~s__state~0 := 8496; 7962#L176 assume !false; 7961#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7960#L29 assume !(8466 == main_~s__state~0); 7959#L32 assume 8496 == main_~s__state~0; 7957#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 7955#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 7953#L176 assume !false; 7951#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7949#L29 assume !(8466 == main_~s__state~0); 7948#L32 assume !(8496 == main_~s__state~0); 7935#L36 assume 8512 == main_~s__state~0; 7724#L37 main_~s__state~0 := 8528; 7725#L176 assume !false; 7703#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7704#L29 assume !(8466 == main_~s__state~0); 8047#L32 assume !(8496 == main_~s__state~0); 7720#L36 assume !(8512 == main_~s__state~0); 7721#L40 assume !(8528 == main_~s__state~0); 7972#L44 assume !(8544 == main_~s__state~0); 7764#L48 assume !(8560 == main_~s__state~0); 7765#L52 [2019-11-15 20:54:19,932 INFO L793 eck$LassoCheckResult]: Loop: 7765#L52 assume !(8576 == main_~s__state~0); 7767#L56 assume 8592 == main_~s__state~0; 7762#L57 main_~s__state~0 := 8608; 7676#L176 assume !false; 7877#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7874#L29 assume !(8466 == main_~s__state~0); 7871#L32 assume !(8496 == main_~s__state~0); 7868#L36 assume !(8512 == main_~s__state~0); 7865#L40 assume !(8528 == main_~s__state~0); 7862#L44 assume !(8544 == main_~s__state~0); 7860#L48 assume !(8560 == main_~s__state~0); 7765#L52 [2019-11-15 20:54:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1695835077, now seen corresponding path program 1 times [2019-11-15 20:54:19,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324924296] [2019-11-15 20:54:19,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 20:54:19,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324924296] [2019-11-15 20:54:19,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:19,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:19,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381619773] [2019-11-15 20:54:19,951 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1642596384, now seen corresponding path program 1 times [2019-11-15 20:54:19,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:19,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356822846] [2019-11-15 20:54:19,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:19,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:19,956 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:19,986 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:19,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:19,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:19,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:19,986 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:54:19,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:19,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:19,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:19,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration10_Loop [2019-11-15 20:54:19,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:19,987 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:19,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:20,015 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:20,016 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/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-11-15 20:54:20,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:54:20,032 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:54:20,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:54:20,060 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:20,067 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:54:20,070 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:54:20,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:54:20,070 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:54:20,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:54:20,070 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:54:20,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:54:20,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:54:20,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:54:20,071 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration10_Loop [2019-11-15 20:54:20,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:54:20,071 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:54:20,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:54:20,103 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:54:20,103 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:54:20,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:54:20,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:54:20,105 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:54:20,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:54:20,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:54:20,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:54:20,106 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:54:20,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:54:20,108 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:54:20,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:54:20,110 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:54:20,111 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:54:20,111 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:54:20,111 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:54:20,111 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8600 Supporting invariants [] [2019-11-15 20:54:20,111 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:54:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:54:20,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:54:20,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:54:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:20,195 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:54:20,195 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 389 states and 503 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-11-15 20:54:20,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 389 states and 503 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 596 states and 801 transitions. Complement of second has 9 states. [2019-11-15 20:54:20,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:54:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:54:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2019-11-15 20:54:20,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 26 letters. Loop has 11 letters. [2019-11-15 20:54:20,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:20,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 37 letters. Loop has 11 letters. [2019-11-15 20:54:20,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:20,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 26 letters. Loop has 22 letters. [2019-11-15 20:54:20,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:54:20,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 596 states and 801 transitions. [2019-11-15 20:54:20,397 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 197 [2019-11-15 20:54:20,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 596 states to 553 states and 744 transitions. [2019-11-15 20:54:20,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2019-11-15 20:54:20,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2019-11-15 20:54:20,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 553 states and 744 transitions. [2019-11-15 20:54:20,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:20,404 INFO L688 BuchiCegarLoop]: Abstraction has 553 states and 744 transitions. [2019-11-15 20:54:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states and 744 transitions. [2019-11-15 20:54:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 452. [2019-11-15 20:54:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-15 20:54:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 598 transitions. [2019-11-15 20:54:20,413 INFO L711 BuchiCegarLoop]: Abstraction has 452 states and 598 transitions. [2019-11-15 20:54:20,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:20,414 INFO L87 Difference]: Start difference. First operand 452 states and 598 transitions. Second operand 3 states. [2019-11-15 20:54:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:20,474 INFO L93 Difference]: Finished difference Result 471 states and 603 transitions. [2019-11-15 20:54:20,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:20,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 603 transitions. [2019-11-15 20:54:20,478 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 166 [2019-11-15 20:54:20,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 442 states and 570 transitions. [2019-11-15 20:54:20,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2019-11-15 20:54:20,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2019-11-15 20:54:20,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 570 transitions. [2019-11-15 20:54:20,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:20,484 INFO L688 BuchiCegarLoop]: Abstraction has 442 states and 570 transitions. [2019-11-15 20:54:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 570 transitions. [2019-11-15 20:54:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-11-15 20:54:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-15 20:54:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 568 transitions. [2019-11-15 20:54:20,493 INFO L711 BuchiCegarLoop]: Abstraction has 440 states and 568 transitions. [2019-11-15 20:54:20,494 INFO L591 BuchiCegarLoop]: Abstraction has 440 states and 568 transitions. [2019-11-15 20:54:20,494 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 20:54:20,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 568 transitions. [2019-11-15 20:54:20,496 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-11-15 20:54:20,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:20,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:20,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,498 INFO L791 eck$LassoCheckResult]: Stem: 9804#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 9805#L176 assume !false; 9990#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9989#L29 assume 8466 == main_~s__state~0; 9987#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 9985#L78-1 main_~s__state~0 := 8496; 9983#L176 assume !false; 9981#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9979#L29 assume !(8466 == main_~s__state~0); 9977#L32 assume 8496 == main_~s__state~0; 9976#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 9974#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 9975#L176 assume !false; 10140#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10138#L29 assume !(8466 == main_~s__state~0); 10137#L32 assume !(8496 == main_~s__state~0); 10136#L36 assume 8512 == main_~s__state~0; 10135#L37 main_~s__state~0 := 8528; 10133#L176 assume !false; 10132#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10129#L29 assume !(8466 == main_~s__state~0); 10125#L32 assume !(8496 == main_~s__state~0); 10121#L36 assume !(8512 == main_~s__state~0); 9739#L40 assume 8528 == main_~s__state~0; 9740#L41 main_~s__state~0 := 8544; 9794#L176 assume !false; 10095#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10147#L29 assume !(8466 == main_~s__state~0); 10145#L32 assume !(8496 == main_~s__state~0); 10142#L36 assume !(8512 == main_~s__state~0); 10100#L40 assume !(8528 == main_~s__state~0); 10043#L44 assume !(8544 == main_~s__state~0); 9906#L48 assume !(8560 == main_~s__state~0); 9857#L52 assume 8576 == main_~s__state~0; 9802#L53 [2019-11-15 20:54:20,499 INFO L793 eck$LassoCheckResult]: Loop: 9802#L53 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 9730#L135 assume !(2 == main_~tmp___1~0);main_~s__state~0 := 8592; 9723#L176 assume !false; 10027#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10024#L29 assume !(8466 == main_~s__state~0); 10020#L32 assume !(8496 == main_~s__state~0); 10017#L36 assume !(8512 == main_~s__state~0); 10014#L40 assume !(8528 == main_~s__state~0); 10011#L44 assume !(8544 == main_~s__state~0); 9845#L48 assume !(8560 == main_~s__state~0); 9846#L52 assume 8576 == main_~s__state~0; 9802#L53 [2019-11-15 20:54:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash -682922250, now seen corresponding path program 1 times [2019-11-15 20:54:20,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683779483] [2019-11-15 20:54:20,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 20:54:20,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683779483] [2019-11-15 20:54:20,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:20,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311374719] [2019-11-15 20:54:20,529 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:20,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,529 INFO L82 PathProgramCache]: Analyzing trace with hash -589369450, now seen corresponding path program 1 times [2019-11-15 20:54:20,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046286012] [2019-11-15 20:54:20,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:54:20,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046286012] [2019-11-15 20:54:20,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:54:20,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201025231] [2019-11-15 20:54:20,546 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:54:20,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:20,547 INFO L87 Difference]: Start difference. First operand 440 states and 568 transitions. cyclomatic complexity: 137 Second operand 3 states. [2019-11-15 20:54:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:20,632 INFO L93 Difference]: Finished difference Result 465 states and 582 transitions. [2019-11-15 20:54:20,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:20,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 582 transitions. [2019-11-15 20:54:20,636 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-11-15 20:54:20,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 456 states and 573 transitions. [2019-11-15 20:54:20,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-11-15 20:54:20,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-11-15 20:54:20,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 456 states and 573 transitions. [2019-11-15 20:54:20,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:20,641 INFO L688 BuchiCegarLoop]: Abstraction has 456 states and 573 transitions. [2019-11-15 20:54:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states and 573 transitions. [2019-11-15 20:54:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 449. [2019-11-15 20:54:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 20:54:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 562 transitions. [2019-11-15 20:54:20,652 INFO L711 BuchiCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-11-15 20:54:20,652 INFO L591 BuchiCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-11-15 20:54:20,652 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 20:54:20,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 562 transitions. [2019-11-15 20:54:20,655 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-11-15 20:54:20,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:20,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:20,656 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,656 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,656 INFO L791 eck$LassoCheckResult]: Stem: 10724#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 10725#L176 assume !false; 10900#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10898#L29 assume 8466 == main_~s__state~0; 10896#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 10890#L78-1 main_~s__state~0 := 8496; 10888#L176 assume !false; 10887#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10886#L29 assume !(8466 == main_~s__state~0); 10885#L32 assume 8496 == main_~s__state~0; 10884#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 10882#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 10883#L176 assume !false; 10922#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10919#L29 assume !(8466 == main_~s__state~0); 10916#L32 assume !(8496 == main_~s__state~0); 10912#L36 assume 8512 == main_~s__state~0; 10908#L37 main_~s__state~0 := 8528; 10903#L176 assume !false; 10902#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10901#L29 assume !(8466 == main_~s__state~0); 10899#L32 assume !(8496 == main_~s__state~0); 10897#L36 assume !(8512 == main_~s__state~0); 10895#L40 assume 8528 == main_~s__state~0; 10709#L41 main_~s__state~0 := 8544; 10710#L176 assume !false; 10920#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10917#L29 assume !(8466 == main_~s__state~0); 10914#L32 assume !(8496 == main_~s__state~0); 10910#L36 assume !(8512 == main_~s__state~0); 10905#L40 assume !(8528 == main_~s__state~0); 10892#L44 assume !(8544 == main_~s__state~0); 10769#L48 assume !(8560 == main_~s__state~0); 10738#L52 assume 8576 == main_~s__state~0; 10719#L53 [2019-11-15 20:54:20,658 INFO L793 eck$LassoCheckResult]: Loop: 10719#L53 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 10642#L135 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 10643#L176 assume !false; 10827#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10825#L29 assume 8466 == main_~s__state~0; 10749#L30 assume !(0 == main_~blastFlag~0); 10820#L78-1 main_~s__state~0 := 8496; 10818#L176 assume !false; 10816#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10814#L29 assume !(8466 == main_~s__state~0); 10812#L32 assume 8496 == main_~s__state~0; 10745#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 10802#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 10799#L176 assume !false; 10797#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10794#L29 assume !(8466 == main_~s__state~0); 10791#L32 assume !(8496 == main_~s__state~0); 10787#L36 assume 8512 == main_~s__state~0; 10741#L37 main_~s__state~0 := 8528; 10780#L176 assume !false; 10776#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10772#L29 assume !(8466 == main_~s__state~0); 10768#L32 assume !(8496 == main_~s__state~0); 10762#L36 assume !(8512 == main_~s__state~0); 10760#L40 assume 8528 == main_~s__state~0; 10736#L41 main_~s__state~0 := 8544; 10635#L176 assume !false; 10752#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10748#L29 assume !(8466 == main_~s__state~0); 10744#L32 assume !(8496 == main_~s__state~0); 10740#L36 assume !(8512 == main_~s__state~0); 10735#L40 assume !(8528 == main_~s__state~0); 10733#L44 assume !(8544 == main_~s__state~0); 10731#L48 assume !(8560 == main_~s__state~0); 10732#L52 assume 8576 == main_~s__state~0; 10719#L53 [2019-11-15 20:54:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,658 INFO L82 PathProgramCache]: Analyzing trace with hash -682922250, now seen corresponding path program 2 times [2019-11-15 20:54:20,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451642829] [2019-11-15 20:54:20,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 20:54:20,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451642829] [2019-11-15 20:54:20,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:20,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145488162] [2019-11-15 20:54:20,688 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2085672464, now seen corresponding path program 1 times [2019-11-15 20:54:20,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323002703] [2019-11-15 20:54:20,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 20:54:20,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323002703] [2019-11-15 20:54:20,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:20,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512853554] [2019-11-15 20:54:20,706 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:54:20,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:20,707 INFO L87 Difference]: Start difference. First operand 449 states and 562 transitions. cyclomatic complexity: 123 Second operand 3 states. [2019-11-15 20:54:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:20,783 INFO L93 Difference]: Finished difference Result 453 states and 549 transitions. [2019-11-15 20:54:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:20,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 453 states and 549 transitions. [2019-11-15 20:54:20,787 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2019-11-15 20:54:20,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 453 states to 415 states and 506 transitions. [2019-11-15 20:54:20,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2019-11-15 20:54:20,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-11-15 20:54:20,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 506 transitions. [2019-11-15 20:54:20,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:20,793 INFO L688 BuchiCegarLoop]: Abstraction has 415 states and 506 transitions. [2019-11-15 20:54:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 506 transitions. [2019-11-15 20:54:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2019-11-15 20:54:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-15 20:54:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 504 transitions. [2019-11-15 20:54:20,802 INFO L711 BuchiCegarLoop]: Abstraction has 413 states and 504 transitions. [2019-11-15 20:54:20,802 INFO L591 BuchiCegarLoop]: Abstraction has 413 states and 504 transitions. [2019-11-15 20:54:20,802 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 20:54:20,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 413 states and 504 transitions. [2019-11-15 20:54:20,805 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-11-15 20:54:20,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:20,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:20,806 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,807 INFO L791 eck$LassoCheckResult]: Stem: 11634#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 11635#L176 assume !false; 11872#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11869#L29 assume 8466 == main_~s__state~0; 11612#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 11613#L78-1 main_~s__state~0 := 8496; 11735#L176 assume !false; 11734#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11733#L29 assume !(8466 == main_~s__state~0); 11731#L32 assume 8496 == main_~s__state~0; 11729#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 11726#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 11722#L176 assume !false; 11720#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11718#L29 assume !(8466 == main_~s__state~0); 11716#L32 assume !(8496 == main_~s__state~0); 11714#L36 assume !(8512 == main_~s__state~0); 11712#L40 assume !(8528 == main_~s__state~0); 11710#L44 assume !(8544 == main_~s__state~0); 11708#L48 assume !(8560 == main_~s__state~0); 11706#L52 assume !(8576 == main_~s__state~0); 11588#L56 assume !(8592 == main_~s__state~0); 11549#L60 assume !(8608 == main_~s__state~0); 11550#L64 assume !(8640 == main_~s__state~0); 11633#L68 assume 8656 == main_~s__state~0; 11541#L69 assume !(2 == main_~blastFlag~0); 11542#L162-1 main_~s__state~0 := 8672; 11574#L176 assume !false; 11899#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11895#L29 assume !(8466 == main_~s__state~0); 11891#L32 assume !(8496 == main_~s__state~0); 11887#L36 assume !(8512 == main_~s__state~0); 11883#L40 assume !(8528 == main_~s__state~0); 11879#L44 assume !(8544 == main_~s__state~0); 11599#L48 assume !(8560 == main_~s__state~0); 11600#L52 assume !(8576 == main_~s__state~0); 11627#L56 assume !(8592 == main_~s__state~0); 11643#L60 assume !(8608 == main_~s__state~0); 11642#L64 assume !(8640 == main_~s__state~0); 11641#L68 assume !(8656 == main_~s__state~0); 11611#L72 [2019-11-15 20:54:20,807 INFO L793 eck$LassoCheckResult]: Loop: 11611#L72 assume 8672 == main_~s__state~0; 11564#L73 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 11565#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 11610#L176 assume !false; 11858#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11857#L29 assume !(8466 == main_~s__state~0); 11854#L32 assume !(8496 == main_~s__state~0); 11852#L36 assume !(8512 == main_~s__state~0); 11850#L40 assume !(8528 == main_~s__state~0); 11848#L44 assume !(8544 == main_~s__state~0); 11846#L48 assume !(8560 == main_~s__state~0); 11844#L52 assume !(8576 == main_~s__state~0); 11587#L56 assume !(8592 == main_~s__state~0); 11547#L60 assume !(8608 == main_~s__state~0); 11548#L64 assume 8640 == main_~s__state~0; 11572#L65 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 11570#L151-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 11571#L176 assume !false; 11702#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11701#L29 assume !(8466 == main_~s__state~0); 11699#L32 assume !(8496 == main_~s__state~0); 11697#L36 assume !(8512 == main_~s__state~0); 11695#L40 assume !(8528 == main_~s__state~0); 11693#L44 assume !(8544 == main_~s__state~0); 11691#L48 assume !(8560 == main_~s__state~0); 11689#L52 assume !(8576 == main_~s__state~0); 11688#L56 assume !(8592 == main_~s__state~0); 11686#L60 assume !(8608 == main_~s__state~0); 11631#L64 assume !(8640 == main_~s__state~0); 11632#L68 assume 8656 == main_~s__state~0; 11539#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 11540#L162-1 main_~s__state~0 := 8672; 11573#L176 assume !false; 11677#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11676#L29 assume !(8466 == main_~s__state~0); 11671#L32 assume !(8496 == main_~s__state~0); 11670#L36 assume !(8512 == main_~s__state~0); 11668#L40 assume !(8528 == main_~s__state~0); 11665#L44 assume !(8544 == main_~s__state~0); 11662#L48 assume !(8560 == main_~s__state~0); 11659#L52 assume !(8576 == main_~s__state~0); 11656#L56 assume !(8592 == main_~s__state~0); 11653#L60 assume !(8608 == main_~s__state~0); 11649#L64 assume !(8640 == main_~s__state~0); 11646#L68 assume !(8656 == main_~s__state~0); 11611#L72 [2019-11-15 20:54:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1636133345, now seen corresponding path program 1 times [2019-11-15 20:54:20,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061002663] [2019-11-15 20:54:20,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:54:20,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061002663] [2019-11-15 20:54:20,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:20,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940865875] [2019-11-15 20:54:20,846 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash -270758187, now seen corresponding path program 1 times [2019-11-15 20:54:20,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250627349] [2019-11-15 20:54:20,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 20:54:20,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250627349] [2019-11-15 20:54:20,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:20,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296996961] [2019-11-15 20:54:20,870 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:54:20,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:20,870 INFO L87 Difference]: Start difference. First operand 413 states and 504 transitions. cyclomatic complexity: 99 Second operand 3 states. [2019-11-15 20:54:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:20,908 INFO L93 Difference]: Finished difference Result 429 states and 511 transitions. [2019-11-15 20:54:20,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:20,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 511 transitions. [2019-11-15 20:54:20,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2019-11-15 20:54:20,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 429 states and 511 transitions. [2019-11-15 20:54:20,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2019-11-15 20:54:20,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2019-11-15 20:54:20,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 429 states and 511 transitions. [2019-11-15 20:54:20,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:20,915 INFO L688 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-11-15 20:54:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states and 511 transitions. [2019-11-15 20:54:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-15 20:54:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-15 20:54:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 511 transitions. [2019-11-15 20:54:20,922 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-11-15 20:54:20,922 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-11-15 20:54:20,922 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 20:54:20,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 511 transitions. [2019-11-15 20:54:20,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2019-11-15 20:54:20,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:20,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:20,926 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,927 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:20,927 INFO L791 eck$LassoCheckResult]: Stem: 12482#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 12483#L176 assume !false; 12738#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12736#L29 assume 8466 == main_~s__state~0; 12459#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 12460#L78-1 main_~s__state~0 := 8496; 12710#L176 assume !false; 12709#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12708#L29 assume !(8466 == main_~s__state~0); 12707#L32 assume 8496 == main_~s__state~0; 12705#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 12706#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 12474#L176 assume !false; 12745#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12744#L29 assume !(8466 == main_~s__state~0); 12741#L32 assume !(8496 == main_~s__state~0); 12740#L36 assume !(8512 == main_~s__state~0); 12739#L40 assume !(8528 == main_~s__state~0); 12737#L44 assume !(8544 == main_~s__state~0); 12445#L48 assume !(8560 == main_~s__state~0); 12446#L52 assume !(8576 == main_~s__state~0); 12435#L56 assume !(8592 == main_~s__state~0); 12398#L60 assume !(8608 == main_~s__state~0); 12399#L64 assume !(8640 == main_~s__state~0); 12481#L68 assume 8656 == main_~s__state~0; 12390#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 12391#L162-1 main_~s__state~0 := 8672; 12420#L176 assume !false; 12603#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12816#L29 assume !(8466 == main_~s__state~0); 12815#L32 assume !(8496 == main_~s__state~0); 12814#L36 assume !(8512 == main_~s__state~0); 12409#L40 assume !(8528 == main_~s__state~0); 12410#L44 assume !(8544 == main_~s__state~0); 12443#L48 assume !(8560 == main_~s__state~0); 12444#L52 assume !(8576 == main_~s__state~0); 12434#L56 assume !(8592 == main_~s__state~0); 12396#L60 assume !(8608 == main_~s__state~0); 12397#L64 assume !(8640 == main_~s__state~0); 12480#L68 assume !(8656 == main_~s__state~0); 12488#L72 [2019-11-15 20:54:20,928 INFO L793 eck$LassoCheckResult]: Loop: 12488#L72 assume 8672 == main_~s__state~0; 12807#L73 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 12805#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 12804#L176 assume !false; 12802#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12800#L29 assume !(8466 == main_~s__state~0); 12798#L32 assume !(8496 == main_~s__state~0); 12796#L36 assume !(8512 == main_~s__state~0); 12794#L40 assume !(8528 == main_~s__state~0); 12792#L44 assume !(8544 == main_~s__state~0); 12790#L48 assume !(8560 == main_~s__state~0); 12787#L52 assume !(8576 == main_~s__state~0); 12785#L56 assume !(8592 == main_~s__state~0); 12782#L60 assume !(8608 == main_~s__state~0); 12724#L64 assume 8640 == main_~s__state~0; 12725#L65 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 12778#L151-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 12777#L176 assume !false; 12775#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12773#L29 assume !(8466 == main_~s__state~0); 12771#L32 assume !(8496 == main_~s__state~0); 12769#L36 assume !(8512 == main_~s__state~0); 12767#L40 assume !(8528 == main_~s__state~0); 12765#L44 assume !(8544 == main_~s__state~0); 12763#L48 assume !(8560 == main_~s__state~0); 12761#L52 assume !(8576 == main_~s__state~0); 12759#L56 assume !(8592 == main_~s__state~0); 12755#L60 assume !(8608 == main_~s__state~0); 12756#L64 assume !(8640 == main_~s__state~0); 12497#L68 assume 8656 == main_~s__state~0; 12493#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 12389#L162-1 main_~s__state~0 := 8672; 12419#L176 assume !false; 12776#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12774#L29 assume !(8466 == main_~s__state~0); 12772#L32 assume !(8496 == main_~s__state~0); 12770#L36 assume !(8512 == main_~s__state~0); 12768#L40 assume !(8528 == main_~s__state~0); 12766#L44 assume !(8544 == main_~s__state~0); 12764#L48 assume !(8560 == main_~s__state~0); 12762#L52 assume !(8576 == main_~s__state~0); 12760#L56 assume !(8592 == main_~s__state~0); 12758#L60 assume !(8608 == main_~s__state~0); 12753#L64 assume !(8640 == main_~s__state~0); 12754#L68 assume !(8656 == main_~s__state~0); 12488#L72 [2019-11-15 20:54:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash -356269667, now seen corresponding path program 1 times [2019-11-15 20:54:20,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295395298] [2019-11-15 20:54:20,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:20,943 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash -270758187, now seen corresponding path program 2 times [2019-11-15 20:54:20,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:20,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274884180] [2019-11-15 20:54:20,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:20,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 20:54:20,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274884180] [2019-11-15 20:54:20,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:20,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:20,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475925089] [2019-11-15 20:54:20,979 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:54:20,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:20,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:20,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:20,979 INFO L87 Difference]: Start difference. First operand 429 states and 511 transitions. cyclomatic complexity: 90 Second operand 3 states. [2019-11-15 20:54:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:21,017 INFO L93 Difference]: Finished difference Result 475 states and 558 transitions. [2019-11-15 20:54:21,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:21,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 475 states and 558 transitions. [2019-11-15 20:54:21,021 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 180 [2019-11-15 20:54:21,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 475 states to 475 states and 558 transitions. [2019-11-15 20:54:21,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2019-11-15 20:54:21,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2019-11-15 20:54:21,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 475 states and 558 transitions. [2019-11-15 20:54:21,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:21,025 INFO L688 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-11-15 20:54:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states and 558 transitions. [2019-11-15 20:54:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2019-11-15 20:54:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-11-15 20:54:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 558 transitions. [2019-11-15 20:54:21,033 INFO L711 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-11-15 20:54:21,033 INFO L591 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-11-15 20:54:21,033 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 20:54:21,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 475 states and 558 transitions. [2019-11-15 20:54:21,036 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 180 [2019-11-15 20:54:21,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:21,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:21,037 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:21,037 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:21,037 INFO L791 eck$LassoCheckResult]: Stem: 13386#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 13387#L176 assume !false; 13556#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13550#L29 assume 8466 == main_~s__state~0; 13545#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 13540#L78-1 main_~s__state~0 := 8496; 13534#L176 assume !false; 13528#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13523#L29 assume !(8466 == main_~s__state~0); 13520#L32 assume 8496 == main_~s__state~0; 13517#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 13508#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 13380#L176 assume !false; 13469#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13467#L29 assume !(8466 == main_~s__state~0); 13465#L32 assume !(8496 == main_~s__state~0); 13463#L36 assume !(8512 == main_~s__state~0); 13462#L40 assume !(8528 == main_~s__state~0); 13461#L44 assume !(8544 == main_~s__state~0); 13460#L48 assume !(8560 == main_~s__state~0); 13459#L52 assume !(8576 == main_~s__state~0); 13457#L56 assume !(8592 == main_~s__state~0); 13456#L60 assume !(8608 == main_~s__state~0); 13454#L64 assume !(8640 == main_~s__state~0); 13396#L68 assume 8656 == main_~s__state~0; 13300#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 13301#L162-1 main_~s__state~0 := 8672; 13331#L176 assume !false; 13631#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13636#L29 assume !(8466 == main_~s__state~0); 13634#L32 assume !(8496 == main_~s__state~0); 13633#L36 assume !(8512 == main_~s__state~0); 13632#L40 assume !(8528 == main_~s__state~0); 13630#L44 assume !(8544 == main_~s__state~0); 13628#L48 assume !(8560 == main_~s__state~0); 13624#L52 assume !(8576 == main_~s__state~0); 13620#L56 assume !(8592 == main_~s__state~0); 13616#L60 assume !(8608 == main_~s__state~0); 13611#L64 assume !(8640 == main_~s__state~0); 13395#L68 assume !(8656 == main_~s__state~0); 13368#L72 [2019-11-15 20:54:21,037 INFO L793 eck$LassoCheckResult]: Loop: 13368#L72 assume 8672 == main_~s__state~0; 13369#L73 assume !(4 == main_~blastFlag~0); 13392#L172 assume !(5 == main_~blastFlag~0); 13370#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 13356#L176 assume !false; 13333#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13315#L29 assume !(8466 == main_~s__state~0); 13316#L32 assume !(8496 == main_~s__state~0); 13325#L36 assume !(8512 == main_~s__state~0); 13769#L40 assume !(8528 == main_~s__state~0); 13768#L44 assume !(8544 == main_~s__state~0); 13767#L48 assume !(8560 == main_~s__state~0); 13765#L52 assume !(8576 == main_~s__state~0); 13751#L56 assume !(8592 == main_~s__state~0); 13306#L60 assume !(8608 == main_~s__state~0); 13307#L64 assume 8640 == main_~s__state~0; 13332#L65 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 13327#L151-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 13328#L176 assume !false; 13766#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13764#L29 assume !(8466 == main_~s__state~0); 13763#L32 assume !(8496 == main_~s__state~0); 13761#L36 assume !(8512 == main_~s__state~0); 13759#L40 assume !(8528 == main_~s__state~0); 13757#L44 assume !(8544 == main_~s__state~0); 13755#L48 assume !(8560 == main_~s__state~0); 13753#L52 assume !(8576 == main_~s__state~0); 13750#L56 assume !(8592 == main_~s__state~0); 13748#L60 assume !(8608 == main_~s__state~0); 13746#L64 assume !(8640 == main_~s__state~0); 13455#L68 assume 8656 == main_~s__state~0; 13453#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 13329#L162-1 main_~s__state~0 := 8672; 13330#L176 assume !false; 13772#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13771#L29 assume !(8466 == main_~s__state~0); 13770#L32 assume !(8496 == main_~s__state~0); 13351#L36 assume !(8512 == main_~s__state~0); 13319#L40 assume !(8528 == main_~s__state~0); 13320#L44 assume !(8544 == main_~s__state~0); 13358#L48 assume !(8560 == main_~s__state~0); 13359#L52 assume !(8576 == main_~s__state~0); 13346#L56 assume !(8592 == main_~s__state~0); 13347#L60 assume !(8608 == main_~s__state~0); 13684#L64 assume !(8640 == main_~s__state~0); 13685#L68 assume !(8656 == main_~s__state~0); 13368#L72 [2019-11-15 20:54:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,038 INFO L82 PathProgramCache]: Analyzing trace with hash -356269667, now seen corresponding path program 2 times [2019-11-15 20:54:21,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795609092] [2019-11-15 20:54:21,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:21,052 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:21,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1348951222, now seen corresponding path program 1 times [2019-11-15 20:54:21,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535182234] [2019-11-15 20:54:21,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 20:54:21,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535182234] [2019-11-15 20:54:21,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:21,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:21,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129447362] [2019-11-15 20:54:21,078 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:54:21,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:21,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:21,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:21,079 INFO L87 Difference]: Start difference. First operand 475 states and 558 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-11-15 20:54:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:21,097 INFO L93 Difference]: Finished difference Result 450 states and 530 transitions. [2019-11-15 20:54:21,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:21,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 530 transitions. [2019-11-15 20:54:21,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 103 [2019-11-15 20:54:21,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 352 states and 424 transitions. [2019-11-15 20:54:21,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2019-11-15 20:54:21,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2019-11-15 20:54:21,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 352 states and 424 transitions. [2019-11-15 20:54:21,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:21,106 INFO L688 BuchiCegarLoop]: Abstraction has 352 states and 424 transitions. [2019-11-15 20:54:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 424 transitions. [2019-11-15 20:54:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-11-15 20:54:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-15 20:54:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 423 transitions. [2019-11-15 20:54:21,113 INFO L711 BuchiCegarLoop]: Abstraction has 351 states and 423 transitions. [2019-11-15 20:54:21,113 INFO L591 BuchiCegarLoop]: Abstraction has 351 states and 423 transitions. [2019-11-15 20:54:21,113 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-15 20:54:21,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 351 states and 423 transitions. [2019-11-15 20:54:21,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 103 [2019-11-15 20:54:21,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:21,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:21,118 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:21,118 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:21,119 INFO L791 eck$LassoCheckResult]: Stem: 14306#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 14307#L176 assume !false; 14556#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14479#L29 assume 8466 == main_~s__state~0; 14480#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 14540#L78-1 main_~s__state~0 := 8496; 14539#L176 assume !false; 14535#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14533#L29 assume !(8466 == main_~s__state~0); 14529#L32 assume 8496 == main_~s__state~0; 14528#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 14526#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 14524#L176 assume !false; 14521#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14518#L29 assume !(8466 == main_~s__state~0); 14515#L32 assume !(8496 == main_~s__state~0); 14513#L36 assume 8512 == main_~s__state~0; 14512#L37 main_~s__state~0 := 8528; 14510#L176 assume !false; 14507#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14504#L29 assume !(8466 == main_~s__state~0); 14501#L32 assume !(8496 == main_~s__state~0); 14498#L36 assume !(8512 == main_~s__state~0); 14462#L40 assume 8528 == main_~s__state~0; 14463#L41 main_~s__state~0 := 8544; 14477#L176 assume !false; 14476#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14474#L29 assume !(8466 == main_~s__state~0); 14472#L32 assume !(8496 == main_~s__state~0); 14470#L36 assume !(8512 == main_~s__state~0); 14468#L40 assume !(8528 == main_~s__state~0); 14465#L44 assume 8544 == main_~s__state~0; 14263#L45 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 14264#L176 assume !false; 14494#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14563#L29 assume !(8466 == main_~s__state~0); 14562#L32 assume !(8496 == main_~s__state~0); 14561#L36 assume !(8512 == main_~s__state~0); 14559#L40 assume !(8528 == main_~s__state~0); 14310#L44 assume !(8544 == main_~s__state~0); 14311#L48 assume !(8560 == main_~s__state~0); 14324#L52 assume 8576 == main_~s__state~0; 14303#L53 [2019-11-15 20:54:21,119 INFO L793 eck$LassoCheckResult]: Loop: 14303#L53 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 14237#L135 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 14238#L176 assume !false; 14455#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14453#L29 assume 8466 == main_~s__state~0; 14407#L30 assume !(0 == main_~blastFlag~0); 14451#L78-1 main_~s__state~0 := 8496; 14449#L176 assume !false; 14447#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14445#L29 assume !(8466 == main_~s__state~0); 14443#L32 assume 8496 == main_~s__state~0; 14403#L33 assume !(1 == main_~blastFlag~0); 14441#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 14439#L176 assume !false; 14437#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14435#L29 assume !(8466 == main_~s__state~0); 14417#L32 assume !(8496 == main_~s__state~0); 14414#L36 assume 8512 == main_~s__state~0; 14392#L37 main_~s__state~0 := 8528; 14405#L176 assume !false; 14401#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14400#L29 assume !(8466 == main_~s__state~0); 14399#L32 assume !(8496 == main_~s__state~0); 14398#L36 assume !(8512 == main_~s__state~0); 14390#L40 assume 8528 == main_~s__state~0; 14387#L41 main_~s__state~0 := 8544; 14384#L176 assume !false; 14380#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14375#L29 assume !(8466 == main_~s__state~0); 14370#L32 assume !(8496 == main_~s__state~0); 14365#L36 assume !(8512 == main_~s__state~0); 14361#L40 assume !(8528 == main_~s__state~0); 14323#L44 assume 8544 == main_~s__state~0; 14322#L45 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 14232#L176 assume !false; 14411#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14406#L29 assume !(8466 == main_~s__state~0); 14402#L32 assume !(8496 == main_~s__state~0); 14391#L36 assume !(8512 == main_~s__state~0); 14388#L40 assume !(8528 == main_~s__state~0); 14360#L44 assume !(8544 == main_~s__state~0); 14314#L48 assume !(8560 == main_~s__state~0); 14315#L52 assume 8576 == main_~s__state~0; 14303#L53 [2019-11-15 20:54:21,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2029459126, now seen corresponding path program 1 times [2019-11-15 20:54:21,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297311832] [2019-11-15 20:54:21,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 20:54:21,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297311832] [2019-11-15 20:54:21,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:21,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:21,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555947763] [2019-11-15 20:54:21,147 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:54:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash -16050654, now seen corresponding path program 1 times [2019-11-15 20:54:21,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174016046] [2019-11-15 20:54:21,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:54:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 20:54:21,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174016046] [2019-11-15 20:54:21,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:54:21,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:54:21,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687859349] [2019-11-15 20:54:21,176 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:54:21,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:54:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:54:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:54:21,176 INFO L87 Difference]: Start difference. First operand 351 states and 423 transitions. cyclomatic complexity: 79 Second operand 3 states. [2019-11-15 20:54:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:54:21,273 INFO L93 Difference]: Finished difference Result 382 states and 443 transitions. [2019-11-15 20:54:21,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:54:21,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 443 transitions. [2019-11-15 20:54:21,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2019-11-15 20:54:21,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 336 states and 390 transitions. [2019-11-15 20:54:21,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2019-11-15 20:54:21,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-11-15 20:54:21,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 336 states and 390 transitions. [2019-11-15 20:54:21,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:54:21,281 INFO L688 BuchiCegarLoop]: Abstraction has 336 states and 390 transitions. [2019-11-15 20:54:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states and 390 transitions. [2019-11-15 20:54:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2019-11-15 20:54:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-15 20:54:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 389 transitions. [2019-11-15 20:54:21,289 INFO L711 BuchiCegarLoop]: Abstraction has 335 states and 389 transitions. [2019-11-15 20:54:21,289 INFO L591 BuchiCegarLoop]: Abstraction has 335 states and 389 transitions. [2019-11-15 20:54:21,289 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-15 20:54:21,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 335 states and 389 transitions. [2019-11-15 20:54:21,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2019-11-15 20:54:21,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:54:21,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:54:21,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:21,296 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:54:21,297 INFO L791 eck$LassoCheckResult]: Stem: 15050#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 15051#L176 assume !false; 15133#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15131#L29 assume 8466 == main_~s__state~0; 15032#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 15033#L78-1 main_~s__state~0 := 8496; 15156#L176 assume !false; 15155#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15153#L29 assume !(8466 == main_~s__state~0); 15151#L32 assume 8496 == main_~s__state~0; 15149#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 15147#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 15146#L176 assume !false; 15145#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15143#L29 assume !(8466 == main_~s__state~0); 15141#L32 assume !(8496 == main_~s__state~0); 15139#L36 assume 8512 == main_~s__state~0; 15137#L37 main_~s__state~0 := 8528; 15136#L176 assume !false; 15135#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15134#L29 assume !(8466 == main_~s__state~0); 15132#L32 assume !(8496 == main_~s__state~0); 15130#L36 assume !(8512 == main_~s__state~0); 15129#L40 assume 8528 == main_~s__state~0; 15128#L41 main_~s__state~0 := 8544; 15126#L176 assume !false; 15123#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15122#L29 assume !(8466 == main_~s__state~0); 15121#L32 assume !(8496 == main_~s__state~0); 15119#L36 assume !(8512 == main_~s__state~0); 15117#L40 assume !(8528 == main_~s__state~0); 15114#L44 assume 8544 == main_~s__state~0; 15115#L45 assume 0 != 1 + main_~s__verify_mode~0; 15208#L105 assume !(0 != main_~s__session__peer~0); 15206#L112 assume !(0 != (256 + main_~s__s3__tmp__new_cipher__algorithms~0) % 4294967296); 15203#L120 main_~s__state~0 := 8576; 15201#L176 assume !false; 15185#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15184#L29 assume !(8466 == main_~s__state~0); 15183#L32 assume !(8496 == main_~s__state~0); 15182#L36 assume !(8512 == main_~s__state~0); 15181#L40 assume !(8528 == main_~s__state~0); 15180#L44 assume !(8544 == main_~s__state~0); 15170#L48 assume !(8560 == main_~s__state~0); 15061#L52 assume 8576 == main_~s__state~0; 15046#L53 [2019-11-15 20:54:21,297 INFO L793 eck$LassoCheckResult]: Loop: 15046#L53 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 14977#L135 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 14978#L176 assume !false; 15200#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15124#L29 assume 8466 == main_~s__state~0; 15125#L30 assume !(0 == main_~blastFlag~0); 15007#L78-1 main_~s__state~0 := 8496; 15008#L176 assume !false; 15164#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15162#L29 assume !(8466 == main_~s__state~0); 15160#L32 assume 8496 == main_~s__state~0; 15052#L33 assume !(1 == main_~blastFlag~0); 15043#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 15044#L176 assume !false; 15194#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15192#L29 assume !(8466 == main_~s__state~0); 15190#L32 assume !(8496 == main_~s__state~0); 15188#L36 assume 8512 == main_~s__state~0; 15017#L37 main_~s__state~0 := 8528; 15018#L176 assume !false; 15154#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15152#L29 assume !(8466 == main_~s__state~0); 15150#L32 assume !(8496 == main_~s__state~0); 15148#L36 assume !(8512 == main_~s__state~0); 15127#L40 assume 8528 == main_~s__state~0; 15035#L41 main_~s__state~0 := 8544; 15036#L176 assume !false; 15144#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15142#L29 assume !(8466 == main_~s__state~0); 15140#L32 assume !(8496 == main_~s__state~0); 15138#L36 assume !(8512 == main_~s__state~0); 15102#L40 assume !(8528 == main_~s__state~0); 15057#L44 assume 8544 == main_~s__state~0; 15001#L45 assume 0 != 1 + main_~s__verify_mode~0; 15003#L105 assume !(0 != main_~s__session__peer~0); 15025#L112 assume !(0 != (256 + main_~s__s3__tmp__new_cipher__algorithms~0) % 4294967296); 15014#L120 main_~s__state~0 := 8576; 14972#L176 assume !false; 15212#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15158#L29 assume !(8466 == main_~s__state~0); 15157#L32 assume !(8496 == main_~s__state~0); 15103#L36 assume !(8512 == main_~s__state~0); 15104#L40 assume !(8528 == main_~s__state~0); 15105#L44 assume !(8544 == main_~s__state~0); 15106#L48 assume !(8560 == main_~s__state~0); 15060#L52 assume 8576 == main_~s__state~0; 15046#L53 [2019-11-15 20:54:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash -904822850, now seen corresponding path program 1 times [2019-11-15 20:54:21,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231124462] [2019-11-15 20:54:21,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:21,335 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1328677862, now seen corresponding path program 1 times [2019-11-15 20:54:21,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826984209] [2019-11-15 20:54:21,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:21,350 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:21,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:54:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2007728355, now seen corresponding path program 1 times [2019-11-15 20:54:21,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:54:21,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735952867] [2019-11-15 20:54:21,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:54:21,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:54:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:54:21,374 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:54:21,537 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2019-11-15 20:54:21,756 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 50 [2019-11-15 20:54:21,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:54:21 BoogieIcfgContainer [2019-11-15 20:54:21,822 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:54:21,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:54:21,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:54:21,823 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:54:21,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:54:14" (3/4) ... [2019-11-15 20:54:21,827 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 20:54:21,938 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f572f4d-03a4-4bda-92ed-9ecfed7833d0/bin/uautomizer/witness.graphml [2019-11-15 20:54:21,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:54:21,940 INFO L168 Benchmark]: Toolchain (without parser) took 8218.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:21,940 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:21,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:21,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:54:21,942 INFO L168 Benchmark]: Boogie Preprocessor took 24.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:21,942 INFO L168 Benchmark]: RCFGBuilder took 472.88 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:21,943 INFO L168 Benchmark]: BuchiAutomizer took 7226.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.9 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:21,943 INFO L168 Benchmark]: Witness Printer took 115.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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:54:21,946 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 472.88 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7226.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.9 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Witness Printer took 115.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: 2.1 MB). Peak memory consumption was 2.1 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 23 terminating modules (15 trivial, 8 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * s__state + 8481 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8576 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8520 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8536 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8552 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8568 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8664 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8600 and consists of 5 locations. 15 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 335 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 17 iterations. TraceHistogramMax:6. Analysis of lassos took 3.1s. Construction of modules took 1.9s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 23. Automata minimization 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 640 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 475 states and ocurred in iteration 14. Nontrivial modules had stage [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1484 SDtfs, 949 SDslu, 774 SDs, 0 SdLazy, 1619 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc0 concLT2 SILN0 SILU0 SILI6 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf99 lsp78 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq197 hnf87 smp100 dnf103 smp97 tf114 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 52]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, tmp___1=2, cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29800b16=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3737e15e=2, s__session__peer=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f9c36be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68641df6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33312301=0, s__hit=0, buf=0, blastFlag=2, s__s3__tmp__new_cipher__algorithms=-256, s__verify_mode=4, s__state=8576} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 52]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L9] int s__state ; [L10] int s__hit = __VERIFIER_nondet_int() ; [L11] int s__verify_mode = __VERIFIER_nondet_int() ; [L12] int s__session__peer = __VERIFIER_nondet_int() ; [L13] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L14] int buf ; [L15] int cb ; [L16] int blastFlag ; [L17] int tmp___1; [L19] s__state = 8466 [L20] blastFlag = 0 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND TRUE s__state == 8466 [L78] COND TRUE blastFlag == 0 [L79] blastFlag = 1 [L81] s__state = 8496 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND TRUE s__state == 8496 [L85] COND TRUE blastFlag == 1 [L86] blastFlag = 2 [L88] COND FALSE !(\read(s__hit)) [L91] s__state = 8512 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND TRUE s__state == 8512 [L96] s__state = 8528 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND TRUE s__state == 8528 [L100] s__state = 8544 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND FALSE !(s__state == 8528) [L44] COND TRUE s__state == 8544 [L104] COND TRUE s__verify_mode + 1 [L105] COND FALSE !(s__session__peer != 0) [L113] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L121] s__state = 8576 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND FALSE !(s__state == 8528) [L44] COND FALSE !(s__state == 8544) [L48] COND FALSE !(s__state == 8560) [L52] COND TRUE s__state == 8576 Loop: [L134] tmp___1 = __VERIFIER_nondet_int() [L135] COND TRUE tmp___1 == 2 [L136] s__state = 8466 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND TRUE s__state == 8466 [L78] COND FALSE !(blastFlag == 0) [L81] s__state = 8496 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND TRUE s__state == 8496 [L85] COND FALSE !(blastFlag == 1) [L88] COND FALSE !(\read(s__hit)) [L91] s__state = 8512 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND TRUE s__state == 8512 [L96] s__state = 8528 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND TRUE s__state == 8528 [L100] s__state = 8544 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND FALSE !(s__state == 8528) [L44] COND TRUE s__state == 8544 [L104] COND TRUE s__verify_mode + 1 [L105] COND FALSE !(s__session__peer != 0) [L113] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L121] s__state = 8576 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND FALSE !(s__state == 8528) [L44] COND FALSE !(s__state == 8544) [L48] COND FALSE !(s__state == 8560) [L52] COND TRUE s__state == 8576 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...