java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:14:32,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:14:32,171 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:14:32,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:14:32,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:14:32,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:14:32,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:14:32,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:14:32,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:14:32,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:14:32,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:14:32,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:14:32,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:14:32,203 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:14:32,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:14:32,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:14:32,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:14:32,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:14:32,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:14:32,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:14:32,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:14:32,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:14:32,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:14:32,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:14:32,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:14:32,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:14:32,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:14:32,228 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:14:32,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:14:32,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:14:32,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:14:32,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:14:32,233 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:14:32,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:14:32,234 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:14:32,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:14:32,236 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:14:32,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:14:32,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:14:32,270 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:14:32,270 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:14:32,271 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:14:32,271 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:14:32,271 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:14:32,271 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:14:32,274 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:14:32,274 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:14:32,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:14:32,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:14:32,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:14:32,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:14:32,275 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:14:32,275 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:14:32,276 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:14:32,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:14:32,276 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:14:32,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:14:32,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:14:32,278 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:14:32,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:14:32,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:14:32,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:14:32,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:14:32,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:14:32,279 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:14:32,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:14:32,279 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:14:32,280 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:14:32,280 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:14:32,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:14:32,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:14:32,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:14:32,365 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:14:32,366 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:14:32,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-14 16:14:32,435 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5ca5c5c/a99ea486d2f24102917e01c9c97ebe42/FLAGe432e1e7e [2018-11-14 16:14:32,933 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:14:32,934 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-14 16:14:32,947 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5ca5c5c/a99ea486d2f24102917e01c9c97ebe42/FLAGe432e1e7e [2018-11-14 16:14:32,962 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5ca5c5c/a99ea486d2f24102917e01c9c97ebe42 [2018-11-14 16:14:32,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:14:32,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:14:32,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:14:32,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:14:32,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:14:32,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:14:32" (1/1) ... [2018-11-14 16:14:32,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8d9b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:32, skipping insertion in model container [2018-11-14 16:14:32,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:14:32" (1/1) ... [2018-11-14 16:14:32,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:14:33,036 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:14:33,330 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:14:33,339 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:14:33,392 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:14:33,409 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:14:33,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33 WrapperNode [2018-11-14 16:14:33,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:14:33,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:14:33,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:14:33,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:14:33,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:14:33,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:14:33,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:14:33,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:14:33,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:14:33,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:14:33,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:14:33,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:14:33,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:14:33,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-14 16:14:33,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:14:33,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-14 16:14:33,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-14 16:14:33,596 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:14:33,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:14:33,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:14:34,529 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:14:34,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:14:34 BoogieIcfgContainer [2018-11-14 16:14:34,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:14:34,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:14:34,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:14:34,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:14:34,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:14:32" (1/3) ... [2018-11-14 16:14:34,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bd8677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:14:34, skipping insertion in model container [2018-11-14 16:14:34,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (2/3) ... [2018-11-14 16:14:34,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bd8677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:14:34, skipping insertion in model container [2018-11-14 16:14:34,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:14:34" (3/3) ... [2018-11-14 16:14:34,539 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-14 16:14:34,549 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:14:34,559 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:14:34,578 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:14:34,614 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:14:34,615 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:14:34,615 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:14:34,616 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:14:34,616 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:14:34,617 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:14:34,617 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:14:34,617 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:14:34,617 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:14:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-14 16:14:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-14 16:14:34,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:34,647 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:34,650 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:34,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:34,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1255492894, now seen corresponding path program 1 times [2018-11-14 16:14:34,662 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:34,663 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:34,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:34,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-14 16:14:34,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-14 16:14:34,833 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #198#return; {54#true} is VALID [2018-11-14 16:14:34,834 INFO L256 TraceCheckUtils]: 3: Hoare triple {54#true} call #t~ret5 := main(); {54#true} is VALID [2018-11-14 16:14:34,847 INFO L273 TraceCheckUtils]: 4: Hoare triple {54#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {71#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:34,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {71#(= (_ bv0 32) main_~blastFlag~0)} assume true; {71#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:34,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {71#(= (_ bv0 32) main_~blastFlag~0)} assume !false; {71#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:34,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {71#(= (_ bv0 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {55#false} is VALID [2018-11-14 16:14:34,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-14 16:14:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:14:34,874 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:34,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:34,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:34,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 16:14:34,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:34,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:34,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:34,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:34,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:34,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:34,936 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-11-14 16:14:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:35,921 INFO L93 Difference]: Finished difference Result 138 states and 226 transitions. [2018-11-14 16:14:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:35,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 16:14:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2018-11-14 16:14:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2018-11-14 16:14:35,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2018-11-14 16:14:36,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:36,582 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:14:36,582 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 16:14:36,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 16:14:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-14 16:14:36,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:36,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-14 16:14:36,730 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-14 16:14:36,730 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-14 16:14:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:36,739 INFO L93 Difference]: Finished difference Result 84 states and 126 transitions. [2018-11-14 16:14:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2018-11-14 16:14:36,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:36,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:36,741 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-14 16:14:36,741 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-14 16:14:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:36,750 INFO L93 Difference]: Finished difference Result 84 states and 126 transitions. [2018-11-14 16:14:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2018-11-14 16:14:36,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:36,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:36,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:36,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 16:14:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2018-11-14 16:14:36,760 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 9 [2018-11-14 16:14:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:36,761 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2018-11-14 16:14:36,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2018-11-14 16:14:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:14:36,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:36,762 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:36,763 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:36,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1634016107, now seen corresponding path program 1 times [2018-11-14 16:14:36,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:36,764 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:36,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:36,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:36,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {562#true} is VALID [2018-11-14 16:14:36,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2018-11-14 16:14:36,875 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #198#return; {562#true} is VALID [2018-11-14 16:14:36,875 INFO L256 TraceCheckUtils]: 3: Hoare triple {562#true} call #t~ret5 := main(); {562#true} is VALID [2018-11-14 16:14:36,875 INFO L273 TraceCheckUtils]: 4: Hoare triple {562#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {562#true} is VALID [2018-11-14 16:14:36,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {562#true} assume true; {562#true} is VALID [2018-11-14 16:14:36,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {562#true} assume !false; {562#true} is VALID [2018-11-14 16:14:36,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {562#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {562#true} is VALID [2018-11-14 16:14:36,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {562#true} assume ~s__state~0 == 8466bv32; {562#true} is VALID [2018-11-14 16:14:36,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {562#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 1bv32; {594#(= (_ bv1 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:36,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {594#(= (_ bv1 32) main_~blastFlag~0)} ~s__state~0 := 8496bv32; {594#(= (_ bv1 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:36,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {594#(= (_ bv1 32) main_~blastFlag~0)} assume true; {594#(= (_ bv1 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:36,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {594#(= (_ bv1 32) main_~blastFlag~0)} assume !false; {594#(= (_ bv1 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:36,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {594#(= (_ bv1 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {563#false} is VALID [2018-11-14 16:14:36,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {563#false} assume !false; {563#false} is VALID [2018-11-14 16:14:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:14:36,925 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:36,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:36,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:36,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:14:36,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:36,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:36,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:36,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:36,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:36,978 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand 3 states. [2018-11-14 16:14:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:37,590 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2018-11-14 16:14:37,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:37,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:14:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-14 16:14:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-14 16:14:37,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2018-11-14 16:14:37,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:37,913 INFO L225 Difference]: With dead ends: 163 [2018-11-14 16:14:37,913 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 16:14:37,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 16:14:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-11-14 16:14:38,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:38,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 122 states. [2018-11-14 16:14:38,036 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states. [2018-11-14 16:14:38,036 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states. [2018-11-14 16:14:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:38,043 INFO L93 Difference]: Finished difference Result 122 states and 181 transitions. [2018-11-14 16:14:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2018-11-14 16:14:38,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:38,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:38,045 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states. [2018-11-14 16:14:38,045 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states. [2018-11-14 16:14:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:38,053 INFO L93 Difference]: Finished difference Result 122 states and 181 transitions. [2018-11-14 16:14:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2018-11-14 16:14:38,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:38,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:38,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:38,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:14:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2018-11-14 16:14:38,062 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 15 [2018-11-14 16:14:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:38,062 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2018-11-14 16:14:38,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2018-11-14 16:14:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:14:38,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:38,064 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:38,064 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:38,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:38,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1077847367, now seen corresponding path program 1 times [2018-11-14 16:14:38,065 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:38,066 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:38,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:38,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:38,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1254#true} is VALID [2018-11-14 16:14:38,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {1254#true} assume true; {1254#true} is VALID [2018-11-14 16:14:38,179 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1254#true} {1254#true} #198#return; {1254#true} is VALID [2018-11-14 16:14:38,179 INFO L256 TraceCheckUtils]: 3: Hoare triple {1254#true} call #t~ret5 := main(); {1254#true} is VALID [2018-11-14 16:14:38,179 INFO L273 TraceCheckUtils]: 4: Hoare triple {1254#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {1254#true} is VALID [2018-11-14 16:14:38,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {1254#true} assume true; {1254#true} is VALID [2018-11-14 16:14:38,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {1254#true} assume !false; {1254#true} is VALID [2018-11-14 16:14:38,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {1254#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1254#true} is VALID [2018-11-14 16:14:38,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {1254#true} assume ~s__state~0 == 8466bv32; {1254#true} is VALID [2018-11-14 16:14:38,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {1254#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 1bv32; {1254#true} is VALID [2018-11-14 16:14:38,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {1254#true} ~s__state~0 := 8496bv32; {1254#true} is VALID [2018-11-14 16:14:38,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {1254#true} assume true; {1254#true} is VALID [2018-11-14 16:14:38,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {1254#true} assume !false; {1254#true} is VALID [2018-11-14 16:14:38,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {1254#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1254#true} is VALID [2018-11-14 16:14:38,182 INFO L273 TraceCheckUtils]: 14: Hoare triple {1254#true} assume !(~s__state~0 == 8466bv32); {1254#true} is VALID [2018-11-14 16:14:38,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {1254#true} assume ~s__state~0 == 8496bv32; {1254#true} is VALID [2018-11-14 16:14:38,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {1254#true} assume ~blastFlag~0 == 1bv32;~blastFlag~0 := 2bv32; {1307#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:38,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {1307#(= (_ bv2 32) main_~blastFlag~0)} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {1307#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:38,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {1307#(= (_ bv2 32) main_~blastFlag~0)} assume true; {1307#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:38,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {1307#(= (_ bv2 32) main_~blastFlag~0)} assume !false; {1307#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:38,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {1307#(= (_ bv2 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {1255#false} is VALID [2018-11-14 16:14:38,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2018-11-14 16:14:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:14:38,197 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:38,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:38,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:38,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:14:38,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:38,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:38,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:38,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:38,234 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand 3 states. [2018-11-14 16:14:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:38,745 INFO L93 Difference]: Finished difference Result 239 states and 364 transitions. [2018-11-14 16:14:38,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:38,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:14:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-14 16:14:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-14 16:14:38,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2018-11-14 16:14:38,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:38,992 INFO L225 Difference]: With dead ends: 239 [2018-11-14 16:14:38,993 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 16:14:38,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 16:14:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-14 16:14:39,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:39,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 160 states. [2018-11-14 16:14:39,169 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-14 16:14:39,170 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-14 16:14:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:39,177 INFO L93 Difference]: Finished difference Result 160 states and 237 transitions. [2018-11-14 16:14:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 237 transitions. [2018-11-14 16:14:39,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:39,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:39,179 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-14 16:14:39,179 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-14 16:14:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:39,187 INFO L93 Difference]: Finished difference Result 160 states and 237 transitions. [2018-11-14 16:14:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 237 transitions. [2018-11-14 16:14:39,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:39,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:39,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:39,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-14 16:14:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 237 transitions. [2018-11-14 16:14:39,196 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 237 transitions. Word has length 22 [2018-11-14 16:14:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:39,197 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 237 transitions. [2018-11-14 16:14:39,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 237 transitions. [2018-11-14 16:14:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 16:14:39,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:39,198 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:39,199 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:39,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1094390367, now seen corresponding path program 1 times [2018-11-14 16:14:39,200 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:39,200 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:39,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:39,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:39,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2202#true} is VALID [2018-11-14 16:14:39,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {2202#true} assume true; {2202#true} is VALID [2018-11-14 16:14:39,339 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2202#true} {2202#true} #198#return; {2202#true} is VALID [2018-11-14 16:14:39,339 INFO L256 TraceCheckUtils]: 3: Hoare triple {2202#true} call #t~ret5 := main(); {2202#true} is VALID [2018-11-14 16:14:39,340 INFO L273 TraceCheckUtils]: 4: Hoare triple {2202#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {2202#true} is VALID [2018-11-14 16:14:39,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {2202#true} assume true; {2202#true} is VALID [2018-11-14 16:14:39,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {2202#true} assume !false; {2202#true} is VALID [2018-11-14 16:14:39,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {2202#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2202#true} is VALID [2018-11-14 16:14:39,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {2202#true} assume ~s__state~0 == 8466bv32; {2202#true} is VALID [2018-11-14 16:14:39,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {2202#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 1bv32; {2202#true} is VALID [2018-11-14 16:14:39,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {2202#true} ~s__state~0 := 8496bv32; {2202#true} is VALID [2018-11-14 16:14:39,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {2202#true} assume true; {2202#true} is VALID [2018-11-14 16:14:39,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {2202#true} assume !false; {2202#true} is VALID [2018-11-14 16:14:39,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {2202#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2202#true} is VALID [2018-11-14 16:14:39,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {2202#true} assume !(~s__state~0 == 8466bv32); {2202#true} is VALID [2018-11-14 16:14:39,343 INFO L273 TraceCheckUtils]: 15: Hoare triple {2202#true} assume ~s__state~0 == 8496bv32; {2202#true} is VALID [2018-11-14 16:14:39,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {2202#true} assume ~blastFlag~0 == 1bv32;~blastFlag~0 := 2bv32; {2202#true} is VALID [2018-11-14 16:14:39,344 INFO L273 TraceCheckUtils]: 17: Hoare triple {2202#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {2202#true} is VALID [2018-11-14 16:14:39,344 INFO L273 TraceCheckUtils]: 18: Hoare triple {2202#true} assume true; {2202#true} is VALID [2018-11-14 16:14:39,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {2202#true} assume !false; {2202#true} is VALID [2018-11-14 16:14:39,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {2202#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2202#true} is VALID [2018-11-14 16:14:39,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {2202#true} assume !(~s__state~0 == 8466bv32); {2202#true} is VALID [2018-11-14 16:14:39,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {2202#true} assume !(~s__state~0 == 8496bv32); {2202#true} is VALID [2018-11-14 16:14:39,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {2202#true} assume !(~s__state~0 == 8512bv32); {2202#true} is VALID [2018-11-14 16:14:39,346 INFO L273 TraceCheckUtils]: 24: Hoare triple {2202#true} assume !(~s__state~0 == 8528bv32); {2202#true} is VALID [2018-11-14 16:14:39,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {2202#true} assume !(~s__state~0 == 8544bv32); {2202#true} is VALID [2018-11-14 16:14:39,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {2202#true} assume !(~s__state~0 == 8560bv32); {2202#true} is VALID [2018-11-14 16:14:39,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {2202#true} assume !(~s__state~0 == 8576bv32); {2202#true} is VALID [2018-11-14 16:14:39,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {2202#true} assume !(~s__state~0 == 8592bv32); {2202#true} is VALID [2018-11-14 16:14:39,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {2202#true} assume !(~s__state~0 == 8608bv32); {2202#true} is VALID [2018-11-14 16:14:39,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {2202#true} assume !(~s__state~0 == 8640bv32); {2202#true} is VALID [2018-11-14 16:14:39,348 INFO L273 TraceCheckUtils]: 31: Hoare triple {2202#true} assume ~s__state~0 == 8656bv32; {2202#true} is VALID [2018-11-14 16:14:39,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {2202#true} assume ~blastFlag~0 == 2bv32;~blastFlag~0 := 3bv32; {2202#true} is VALID [2018-11-14 16:14:39,354 INFO L273 TraceCheckUtils]: 33: Hoare triple {2202#true} ~s__state~0 := 8672bv32; {2306#(= (_ bv8672 32) main_~s__state~0)} is VALID [2018-11-14 16:14:39,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {2306#(= (_ bv8672 32) main_~s__state~0)} assume true; {2306#(= (_ bv8672 32) main_~s__state~0)} is VALID [2018-11-14 16:14:39,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {2306#(= (_ bv8672 32) main_~s__state~0)} assume !false; {2306#(= (_ bv8672 32) main_~s__state~0)} is VALID [2018-11-14 16:14:39,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {2306#(= (_ bv8672 32) main_~s__state~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {2203#false} is VALID [2018-11-14 16:14:39,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2018-11-14 16:14:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-14 16:14:39,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:39,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:39,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:39,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-14 16:14:39,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:39,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:39,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:39,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:39,405 INFO L87 Difference]: Start difference. First operand 160 states and 237 transitions. Second operand 3 states. [2018-11-14 16:14:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:39,799 INFO L93 Difference]: Finished difference Result 362 states and 549 transitions. [2018-11-14 16:14:39,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:39,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-14 16:14:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2018-11-14 16:14:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2018-11-14 16:14:39,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 163 transitions. [2018-11-14 16:14:40,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:40,076 INFO L225 Difference]: With dead ends: 362 [2018-11-14 16:14:40,077 INFO L226 Difference]: Without dead ends: 207 [2018-11-14 16:14:40,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-14 16:14:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2018-11-14 16:14:40,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:40,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand 202 states. [2018-11-14 16:14:40,196 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 202 states. [2018-11-14 16:14:40,196 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 202 states. [2018-11-14 16:14:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:40,204 INFO L93 Difference]: Finished difference Result 207 states and 283 transitions. [2018-11-14 16:14:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 283 transitions. [2018-11-14 16:14:40,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:40,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:40,206 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 207 states. [2018-11-14 16:14:40,206 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 207 states. [2018-11-14 16:14:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:40,214 INFO L93 Difference]: Finished difference Result 207 states and 283 transitions. [2018-11-14 16:14:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 283 transitions. [2018-11-14 16:14:40,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:40,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:40,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:40,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-14 16:14:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2018-11-14 16:14:40,223 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 38 [2018-11-14 16:14:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:40,223 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2018-11-14 16:14:40,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2018-11-14 16:14:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 16:14:40,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:40,225 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:40,225 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:40,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1893868002, now seen corresponding path program 1 times [2018-11-14 16:14:40,227 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:40,227 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:40,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:40,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:40,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {3494#true} call ULTIMATE.init(); {3494#true} is VALID [2018-11-14 16:14:40,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {3494#true} assume true; {3494#true} is VALID [2018-11-14 16:14:40,466 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3494#true} {3494#true} #198#return; {3494#true} is VALID [2018-11-14 16:14:40,467 INFO L256 TraceCheckUtils]: 3: Hoare triple {3494#true} call #t~ret5 := main(); {3494#true} is VALID [2018-11-14 16:14:40,467 INFO L273 TraceCheckUtils]: 4: Hoare triple {3494#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {3494#true} is VALID [2018-11-14 16:14:40,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {3494#true} assume true; {3494#true} is VALID [2018-11-14 16:14:40,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {3494#true} assume !false; {3494#true} is VALID [2018-11-14 16:14:40,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {3494#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {3494#true} is VALID [2018-11-14 16:14:40,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {3494#true} assume ~s__state~0 == 8466bv32; {3494#true} is VALID [2018-11-14 16:14:40,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {3494#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 1bv32; {3494#true} is VALID [2018-11-14 16:14:40,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {3494#true} ~s__state~0 := 8496bv32; {3494#true} is VALID [2018-11-14 16:14:40,469 INFO L273 TraceCheckUtils]: 11: Hoare triple {3494#true} assume true; {3494#true} is VALID [2018-11-14 16:14:40,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {3494#true} assume !false; {3494#true} is VALID [2018-11-14 16:14:40,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {3494#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {3494#true} is VALID [2018-11-14 16:14:40,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {3494#true} assume !(~s__state~0 == 8466bv32); {3494#true} is VALID [2018-11-14 16:14:40,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {3494#true} assume ~s__state~0 == 8496bv32; {3494#true} is VALID [2018-11-14 16:14:40,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {3494#true} assume ~blastFlag~0 == 1bv32;~blastFlag~0 := 2bv32; {3494#true} is VALID [2018-11-14 16:14:40,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {3494#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {3494#true} is VALID [2018-11-14 16:14:40,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {3494#true} assume true; {3494#true} is VALID [2018-11-14 16:14:40,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {3494#true} assume !false; {3494#true} is VALID [2018-11-14 16:14:40,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {3494#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {3494#true} is VALID [2018-11-14 16:14:40,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {3494#true} assume !(~s__state~0 == 8466bv32); {3494#true} is VALID [2018-11-14 16:14:40,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {3494#true} assume !(~s__state~0 == 8496bv32); {3494#true} is VALID [2018-11-14 16:14:40,472 INFO L273 TraceCheckUtils]: 23: Hoare triple {3494#true} assume !(~s__state~0 == 8512bv32); {3494#true} is VALID [2018-11-14 16:14:40,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {3494#true} assume !(~s__state~0 == 8528bv32); {3494#true} is VALID [2018-11-14 16:14:40,473 INFO L273 TraceCheckUtils]: 25: Hoare triple {3494#true} assume !(~s__state~0 == 8544bv32); {3494#true} is VALID [2018-11-14 16:14:40,473 INFO L273 TraceCheckUtils]: 26: Hoare triple {3494#true} assume !(~s__state~0 == 8560bv32); {3494#true} is VALID [2018-11-14 16:14:40,474 INFO L273 TraceCheckUtils]: 27: Hoare triple {3494#true} assume !(~s__state~0 == 8576bv32); {3494#true} is VALID [2018-11-14 16:14:40,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {3494#true} assume !(~s__state~0 == 8592bv32); {3494#true} is VALID [2018-11-14 16:14:40,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {3494#true} assume !(~s__state~0 == 8608bv32); {3494#true} is VALID [2018-11-14 16:14:40,475 INFO L273 TraceCheckUtils]: 30: Hoare triple {3494#true} assume !(~s__state~0 == 8640bv32); {3494#true} is VALID [2018-11-14 16:14:40,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {3494#true} assume ~s__state~0 == 8656bv32; {3494#true} is VALID [2018-11-14 16:14:40,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {3494#true} assume ~blastFlag~0 == 2bv32;~blastFlag~0 := 3bv32; {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} ~s__state~0 := 8672bv32; {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,481 INFO L273 TraceCheckUtils]: 34: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume true; {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,483 INFO L273 TraceCheckUtils]: 35: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !false; {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,497 INFO L273 TraceCheckUtils]: 37: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8466bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8496bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8512bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,499 INFO L273 TraceCheckUtils]: 40: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8528bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,499 INFO L273 TraceCheckUtils]: 41: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8544bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8560bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,507 INFO L273 TraceCheckUtils]: 43: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8576bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,510 INFO L273 TraceCheckUtils]: 44: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8592bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8608bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8640bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,513 INFO L273 TraceCheckUtils]: 47: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~s__state~0 == 8656bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,516 INFO L273 TraceCheckUtils]: 48: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume ~s__state~0 == 8672bv32; {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,516 INFO L273 TraceCheckUtils]: 49: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume !(~blastFlag~0 == 4bv32); {3595#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:40,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {3595#(= (_ bv3 32) main_~blastFlag~0)} assume ~blastFlag~0 == 5bv32; {3495#false} is VALID [2018-11-14 16:14:40,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2018-11-14 16:14:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-14 16:14:40,524 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:40,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:40,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:40,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-14 16:14:40,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:40,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:40,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:40,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:40,672 INFO L87 Difference]: Start difference. First operand 202 states and 279 transitions. Second operand 3 states. [2018-11-14 16:14:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:41,175 INFO L93 Difference]: Finished difference Result 401 states and 561 transitions. [2018-11-14 16:14:41,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:41,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-14 16:14:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2018-11-14 16:14:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2018-11-14 16:14:41,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 199 transitions. [2018-11-14 16:14:41,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:41,456 INFO L225 Difference]: With dead ends: 401 [2018-11-14 16:14:41,456 INFO L226 Difference]: Without dead ends: 256 [2018-11-14 16:14:41,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-14 16:14:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2018-11-14 16:14:41,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:41,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand 254 states. [2018-11-14 16:14:41,638 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 254 states. [2018-11-14 16:14:41,638 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 254 states. [2018-11-14 16:14:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:41,648 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2018-11-14 16:14:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2018-11-14 16:14:41,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:41,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:41,649 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand 256 states. [2018-11-14 16:14:41,649 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 256 states. [2018-11-14 16:14:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:41,659 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2018-11-14 16:14:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2018-11-14 16:14:41,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:41,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:41,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:41,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-14 16:14:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 350 transitions. [2018-11-14 16:14:41,670 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 350 transitions. Word has length 52 [2018-11-14 16:14:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:41,671 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 350 transitions. [2018-11-14 16:14:41,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 350 transitions. [2018-11-14 16:14:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 16:14:41,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:41,673 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:41,673 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:41,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash -174827734, now seen corresponding path program 1 times [2018-11-14 16:14:41,674 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:41,674 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:41,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:41,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:42,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {5036#true} call ULTIMATE.init(); {5036#true} is VALID [2018-11-14 16:14:42,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {5036#true} assume true; {5036#true} is VALID [2018-11-14 16:14:42,279 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5036#true} {5036#true} #198#return; {5036#true} is VALID [2018-11-14 16:14:42,279 INFO L256 TraceCheckUtils]: 3: Hoare triple {5036#true} call #t~ret5 := main(); {5036#true} is VALID [2018-11-14 16:14:42,279 INFO L273 TraceCheckUtils]: 4: Hoare triple {5036#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {5036#true} is VALID [2018-11-14 16:14:42,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {5036#true} assume true; {5036#true} is VALID [2018-11-14 16:14:42,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {5036#true} assume !false; {5036#true} is VALID [2018-11-14 16:14:42,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {5036#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {5036#true} is VALID [2018-11-14 16:14:42,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {5036#true} assume ~s__state~0 == 8466bv32; {5036#true} is VALID [2018-11-14 16:14:42,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {5036#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 1bv32; {5036#true} is VALID [2018-11-14 16:14:42,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {5036#true} ~s__state~0 := 8496bv32; {5036#true} is VALID [2018-11-14 16:14:42,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {5036#true} assume true; {5036#true} is VALID [2018-11-14 16:14:42,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {5036#true} assume !false; {5036#true} is VALID [2018-11-14 16:14:42,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {5036#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {5036#true} is VALID [2018-11-14 16:14:42,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {5036#true} assume !(~s__state~0 == 8466bv32); {5036#true} is VALID [2018-11-14 16:14:42,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {5036#true} assume ~s__state~0 == 8496bv32; {5036#true} is VALID [2018-11-14 16:14:42,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {5036#true} assume ~blastFlag~0 == 1bv32;~blastFlag~0 := 2bv32; {5036#true} is VALID [2018-11-14 16:14:42,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {5036#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {5036#true} is VALID [2018-11-14 16:14:42,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {5036#true} assume true; {5036#true} is VALID [2018-11-14 16:14:42,283 INFO L273 TraceCheckUtils]: 19: Hoare triple {5036#true} assume !false; {5036#true} is VALID [2018-11-14 16:14:42,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {5036#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {5036#true} is VALID [2018-11-14 16:14:42,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {5036#true} assume !(~s__state~0 == 8466bv32); {5036#true} is VALID [2018-11-14 16:14:42,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {5036#true} assume !(~s__state~0 == 8496bv32); {5036#true} is VALID [2018-11-14 16:14:42,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {5036#true} assume !(~s__state~0 == 8512bv32); {5036#true} is VALID [2018-11-14 16:14:42,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {5036#true} assume !(~s__state~0 == 8528bv32); {5036#true} is VALID [2018-11-14 16:14:42,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {5036#true} assume !(~s__state~0 == 8544bv32); {5036#true} is VALID [2018-11-14 16:14:42,284 INFO L273 TraceCheckUtils]: 26: Hoare triple {5036#true} assume !(~s__state~0 == 8560bv32); {5036#true} is VALID [2018-11-14 16:14:42,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {5036#true} assume !(~s__state~0 == 8576bv32); {5036#true} is VALID [2018-11-14 16:14:42,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {5036#true} assume !(~s__state~0 == 8592bv32); {5036#true} is VALID [2018-11-14 16:14:42,285 INFO L273 TraceCheckUtils]: 29: Hoare triple {5036#true} assume !(~s__state~0 == 8608bv32); {5036#true} is VALID [2018-11-14 16:14:42,285 INFO L273 TraceCheckUtils]: 30: Hoare triple {5036#true} assume !(~s__state~0 == 8640bv32); {5036#true} is VALID [2018-11-14 16:14:42,285 INFO L273 TraceCheckUtils]: 31: Hoare triple {5036#true} assume ~s__state~0 == 8656bv32; {5036#true} is VALID [2018-11-14 16:14:42,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {5036#true} assume ~blastFlag~0 == 2bv32;~blastFlag~0 := 3bv32; {5036#true} is VALID [2018-11-14 16:14:42,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {5036#true} ~s__state~0 := 8672bv32; {5036#true} is VALID [2018-11-14 16:14:42,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {5036#true} assume true; {5036#true} is VALID [2018-11-14 16:14:42,286 INFO L273 TraceCheckUtils]: 35: Hoare triple {5036#true} assume !false; {5036#true} is VALID [2018-11-14 16:14:42,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {5036#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {5036#true} is VALID [2018-11-14 16:14:42,286 INFO L273 TraceCheckUtils]: 37: Hoare triple {5036#true} assume !(~s__state~0 == 8466bv32); {5036#true} is VALID [2018-11-14 16:14:42,286 INFO L273 TraceCheckUtils]: 38: Hoare triple {5036#true} assume !(~s__state~0 == 8496bv32); {5036#true} is VALID [2018-11-14 16:14:42,287 INFO L273 TraceCheckUtils]: 39: Hoare triple {5036#true} assume !(~s__state~0 == 8512bv32); {5036#true} is VALID [2018-11-14 16:14:42,287 INFO L273 TraceCheckUtils]: 40: Hoare triple {5036#true} assume !(~s__state~0 == 8528bv32); {5036#true} is VALID [2018-11-14 16:14:42,287 INFO L273 TraceCheckUtils]: 41: Hoare triple {5036#true} assume !(~s__state~0 == 8544bv32); {5036#true} is VALID [2018-11-14 16:14:42,287 INFO L273 TraceCheckUtils]: 42: Hoare triple {5036#true} assume !(~s__state~0 == 8560bv32); {5036#true} is VALID [2018-11-14 16:14:42,287 INFO L273 TraceCheckUtils]: 43: Hoare triple {5036#true} assume !(~s__state~0 == 8576bv32); {5036#true} is VALID [2018-11-14 16:14:42,287 INFO L273 TraceCheckUtils]: 44: Hoare triple {5036#true} assume !(~s__state~0 == 8592bv32); {5036#true} is VALID [2018-11-14 16:14:42,288 INFO L273 TraceCheckUtils]: 45: Hoare triple {5036#true} assume !(~s__state~0 == 8608bv32); {5036#true} is VALID [2018-11-14 16:14:42,288 INFO L273 TraceCheckUtils]: 46: Hoare triple {5036#true} assume !(~s__state~0 == 8640bv32); {5036#true} is VALID [2018-11-14 16:14:42,288 INFO L273 TraceCheckUtils]: 47: Hoare triple {5036#true} assume !(~s__state~0 == 8656bv32); {5036#true} is VALID [2018-11-14 16:14:42,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {5036#true} assume ~s__state~0 == 8672bv32; {5036#true} is VALID [2018-11-14 16:14:42,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {5036#true} assume !(~blastFlag~0 == 4bv32); {5036#true} is VALID [2018-11-14 16:14:42,288 INFO L273 TraceCheckUtils]: 50: Hoare triple {5036#true} assume !(~blastFlag~0 == 5bv32); {5036#true} is VALID [2018-11-14 16:14:42,289 INFO L273 TraceCheckUtils]: 51: Hoare triple {5036#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8640bv32; {5194#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-14 16:14:42,289 INFO L273 TraceCheckUtils]: 52: Hoare triple {5194#(= (_ bv8640 32) main_~s__state~0)} assume true; {5194#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-14 16:14:42,291 INFO L273 TraceCheckUtils]: 53: Hoare triple {5194#(= (_ bv8640 32) main_~s__state~0)} assume !false; {5194#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-14 16:14:42,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {5194#(= (_ bv8640 32) main_~s__state~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {5037#false} is VALID [2018-11-14 16:14:42,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {5037#false} assume !false; {5037#false} is VALID [2018-11-14 16:14:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 16:14:42,294 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:42,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:42,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:42,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-14 16:14:42,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:42,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:42,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:42,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:42,362 INFO L87 Difference]: Start difference. First operand 254 states and 350 transitions. Second operand 3 states. [2018-11-14 16:14:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:43,007 INFO L93 Difference]: Finished difference Result 536 states and 761 transitions. [2018-11-14 16:14:43,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:43,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-14 16:14:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2018-11-14 16:14:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2018-11-14 16:14:43,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2018-11-14 16:14:43,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:43,254 INFO L225 Difference]: With dead ends: 536 [2018-11-14 16:14:43,255 INFO L226 Difference]: Without dead ends: 287 [2018-11-14 16:14:43,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-14 16:14:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-14 16:14:43,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:43,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand 287 states. [2018-11-14 16:14:43,501 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand 287 states. [2018-11-14 16:14:43,501 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 287 states. [2018-11-14 16:14:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:43,511 INFO L93 Difference]: Finished difference Result 287 states and 364 transitions. [2018-11-14 16:14:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 364 transitions. [2018-11-14 16:14:43,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:43,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:43,512 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand 287 states. [2018-11-14 16:14:43,512 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 287 states. [2018-11-14 16:14:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:43,520 INFO L93 Difference]: Finished difference Result 287 states and 364 transitions. [2018-11-14 16:14:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 364 transitions. [2018-11-14 16:14:43,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:43,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:43,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:43,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-14 16:14:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 364 transitions. [2018-11-14 16:14:43,530 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 364 transitions. Word has length 56 [2018-11-14 16:14:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:43,530 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 364 transitions. [2018-11-14 16:14:43,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 364 transitions. [2018-11-14 16:14:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-14 16:14:43,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:43,532 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:43,532 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:43,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash 64306192, now seen corresponding path program 1 times [2018-11-14 16:14:43,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:43,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:43,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:43,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:44,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {6835#true} call ULTIMATE.init(); {6835#true} is VALID [2018-11-14 16:14:44,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {6835#true} assume true; {6835#true} is VALID [2018-11-14 16:14:44,465 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6835#true} {6835#true} #198#return; {6835#true} is VALID [2018-11-14 16:14:44,465 INFO L256 TraceCheckUtils]: 3: Hoare triple {6835#true} call #t~ret5 := main(); {6835#true} is VALID [2018-11-14 16:14:44,465 INFO L273 TraceCheckUtils]: 4: Hoare triple {6835#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {6835#true} is VALID [2018-11-14 16:14:44,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {6835#true} assume true; {6835#true} is VALID [2018-11-14 16:14:44,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {6835#true} assume !false; {6835#true} is VALID [2018-11-14 16:14:44,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {6835#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6835#true} is VALID [2018-11-14 16:14:44,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {6835#true} assume ~s__state~0 == 8466bv32; {6835#true} is VALID [2018-11-14 16:14:44,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {6835#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 1bv32; {6835#true} is VALID [2018-11-14 16:14:44,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {6835#true} ~s__state~0 := 8496bv32; {6835#true} is VALID [2018-11-14 16:14:44,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {6835#true} assume true; {6835#true} is VALID [2018-11-14 16:14:44,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {6835#true} assume !false; {6835#true} is VALID [2018-11-14 16:14:44,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {6835#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6835#true} is VALID [2018-11-14 16:14:44,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {6835#true} assume !(~s__state~0 == 8466bv32); {6835#true} is VALID [2018-11-14 16:14:44,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {6835#true} assume ~s__state~0 == 8496bv32; {6835#true} is VALID [2018-11-14 16:14:44,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {6835#true} assume ~blastFlag~0 == 1bv32;~blastFlag~0 := 2bv32; {6835#true} is VALID [2018-11-14 16:14:44,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {6835#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume true; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8466bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8496bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8512bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8528bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8544bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8560bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8576bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8592bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,483 INFO L273 TraceCheckUtils]: 29: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8608bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8640bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,484 INFO L273 TraceCheckUtils]: 31: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume ~s__state~0 == 8656bv32; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,484 INFO L273 TraceCheckUtils]: 32: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume ~blastFlag~0 == 2bv32;~blastFlag~0 := 3bv32; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} ~s__state~0 := 8672bv32; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,486 INFO L273 TraceCheckUtils]: 34: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume true; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,486 INFO L273 TraceCheckUtils]: 35: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8466bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8496bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,492 INFO L273 TraceCheckUtils]: 39: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8512bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,492 INFO L273 TraceCheckUtils]: 40: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8528bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8544bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,493 INFO L273 TraceCheckUtils]: 42: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8560bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,493 INFO L273 TraceCheckUtils]: 43: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8576bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8592bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,494 INFO L273 TraceCheckUtils]: 45: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8608bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,494 INFO L273 TraceCheckUtils]: 46: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8640bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,495 INFO L273 TraceCheckUtils]: 47: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8656bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,495 INFO L273 TraceCheckUtils]: 48: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume ~s__state~0 == 8672bv32; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,500 INFO L273 TraceCheckUtils]: 49: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~blastFlag~0 == 4bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,501 INFO L273 TraceCheckUtils]: 50: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~blastFlag~0 == 5bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume ~s__hit~0 != 0bv32;~s__state~0 := 8640bv32; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,522 INFO L273 TraceCheckUtils]: 52: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume true; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,522 INFO L273 TraceCheckUtils]: 53: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,523 INFO L273 TraceCheckUtils]: 54: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8466bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,523 INFO L273 TraceCheckUtils]: 56: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8496bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,526 INFO L273 TraceCheckUtils]: 57: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8512bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,526 INFO L273 TraceCheckUtils]: 58: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8528bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8544bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,527 INFO L273 TraceCheckUtils]: 60: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8560bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,529 INFO L273 TraceCheckUtils]: 61: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8576bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,532 INFO L273 TraceCheckUtils]: 62: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8592bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,535 INFO L273 TraceCheckUtils]: 63: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8608bv32); {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,537 INFO L273 TraceCheckUtils]: 64: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume ~s__state~0 == 8640bv32; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,539 INFO L273 TraceCheckUtils]: 65: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume ~blastFlag~0 == 3bv32;~blastFlag~0 := 4bv32; {6891#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:44,539 INFO L273 TraceCheckUtils]: 66: Hoare triple {6891#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__hit~0 != 0bv32);~s__state~0 := 8656bv32; {6836#false} is VALID [2018-11-14 16:14:44,539 INFO L273 TraceCheckUtils]: 67: Hoare triple {6836#false} assume true; {6836#false} is VALID [2018-11-14 16:14:44,539 INFO L273 TraceCheckUtils]: 68: Hoare triple {6836#false} assume !false; {6836#false} is VALID [2018-11-14 16:14:44,540 INFO L273 TraceCheckUtils]: 69: Hoare triple {6836#false} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {6836#false} is VALID [2018-11-14 16:14:44,540 INFO L273 TraceCheckUtils]: 70: Hoare triple {6836#false} assume !false; {6836#false} is VALID [2018-11-14 16:14:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-14 16:14:44,545 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:44,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:44,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:44,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-14 16:14:44,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:44,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:44,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:44,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:44,699 INFO L87 Difference]: Start difference. First operand 287 states and 364 transitions. Second operand 3 states. [2018-11-14 16:14:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:45,356 INFO L93 Difference]: Finished difference Result 702 states and 885 transitions. [2018-11-14 16:14:45,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:45,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-14 16:14:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-14 16:14:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-14 16:14:45,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2018-11-14 16:14:45,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:45,973 INFO L225 Difference]: With dead ends: 702 [2018-11-14 16:14:45,973 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:14:45,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:14:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:14:45,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:45,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:45,975 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:45,975 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:45,975 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:14:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:14:45,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:45,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:45,976 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:45,976 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:45,976 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:14:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:14:45,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:45,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:45,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:45,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:14:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:14:45,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-11-14 16:14:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:45,977 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:14:45,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:14:45,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:45,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:14:46,328 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-14 16:14:46,715 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 16:14:46,715 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:14:46,715 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:14:46,716 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:14:46,716 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:14:46,716 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:14:46,716 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 218) no Hoare annotation was computed. [2018-11-14 16:14:46,716 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 186) no Hoare annotation was computed. [2018-11-14 16:14:46,716 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 190) no Hoare annotation was computed. [2018-11-14 16:14:46,716 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2018-11-14 16:14:46,716 INFO L425 ceAbstractionStarter]: For program point L53(lines 53 194) no Hoare annotation was computed. [2018-11-14 16:14:46,716 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 75 184) no Hoare annotation was computed. [2018-11-14 16:14:46,717 INFO L421 ceAbstractionStarter]: At program point L177(lines 23 212) the Hoare annotation is: (let ((.cse0 (= (_ bv3 32) main_~blastFlag~0))) (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0) (and (= (_ bv8672 32) main_~s__state~0) .cse0) (and .cse0 (not (= (_ bv0 32) main_~s__hit~0)) (= (_ bv8640 32) main_~s__state~0)))) [2018-11-14 16:14:46,717 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2018-11-14 16:14:46,717 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2018-11-14 16:14:46,717 INFO L421 ceAbstractionStarter]: At program point L70(lines 69 186) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,717 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 202) no Hoare annotation was computed. [2018-11-14 16:14:46,717 INFO L421 ceAbstractionStarter]: At program point L62(lines 61 190) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,717 INFO L421 ceAbstractionStarter]: At program point L54(lines 53 194) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,718 INFO L421 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,718 INFO L425 ceAbstractionStarter]: For program point L79-1(lines 79 81) no Hoare annotation was computed. [2018-11-14 16:14:46,718 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 218) no Hoare annotation was computed. [2018-11-14 16:14:46,718 INFO L425 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2018-11-14 16:14:46,718 INFO L421 ceAbstractionStarter]: At program point L38(lines 37 202) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,718 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 205) no Hoare annotation was computed. [2018-11-14 16:14:46,718 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 218) the Hoare annotation is: true [2018-11-14 16:14:46,719 INFO L421 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,719 INFO L421 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,719 INFO L425 ceAbstractionStarter]: For program point L163-1(lines 163 165) no Hoare annotation was computed. [2018-11-14 16:14:46,719 INFO L421 ceAbstractionStarter]: At program point L31(lines 30 205) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,719 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2018-11-14 16:14:46,719 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 212) no Hoare annotation was computed. [2018-11-14 16:14:46,719 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L425 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 188) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 192) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L428 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2018-11-14 16:14:46,720 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 196) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-11-14 16:14:46,720 INFO L421 ceAbstractionStarter]: At program point L74(lines 73 184) the Hoare annotation is: (let ((.cse0 (= (_ bv8672 32) main_~s__state~0))) (or (and .cse0 (= (_ bv2 32) main_~blastFlag~0)) (and (= (_ bv0 32) main_~blastFlag~0) .cse0) (and .cse0 (= (_ bv3 32) main_~blastFlag~0)) (and (= (_ bv1 32) main_~blastFlag~0) .cse0))) [2018-11-14 16:14:46,721 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 200) no Hoare annotation was computed. [2018-11-14 16:14:46,721 INFO L421 ceAbstractionStarter]: At program point L66(lines 65 188) the Hoare annotation is: (let ((.cse0 (= (_ bv8640 32) main_~s__state~0))) (or (and (= (_ bv3 32) main_~blastFlag~0) (not (= (_ bv0 32) main_~s__hit~0)) .cse0) (and (= (_ bv1 32) main_~blastFlag~0) .cse0) (and (= (_ bv0 32) main_~blastFlag~0) .cse0) (and (= (_ bv2 32) main_~blastFlag~0) .cse0))) [2018-11-14 16:14:46,721 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 204) no Hoare annotation was computed. [2018-11-14 16:14:46,721 INFO L421 ceAbstractionStarter]: At program point L58(lines 57 192) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,721 INFO L421 ceAbstractionStarter]: At program point L50(lines 49 196) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,721 INFO L421 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2018-11-14 16:14:46,721 INFO L421 ceAbstractionStarter]: At program point L42(lines 41 200) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,721 INFO L421 ceAbstractionStarter]: At program point L34(lines 33 204) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:46,723 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:14:46,724 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:14:46,724 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:14:46,724 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 16:14:46,724 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:14:46,724 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 16:14:46,724 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 16:14:46,725 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 16:14:46,726 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-14 16:14:46,726 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-14 16:14:46,726 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-14 16:14:46,726 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-14 16:14:46,726 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-14 16:14:46,726 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-14 16:14:46,726 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-14 16:14:46,727 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 16:14:46,727 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 16:14:46,748 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-14 16:14:46,748 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-14 16:14:46,748 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-14 16:14:46,762 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-14 16:14:46,762 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-14 16:14:46,762 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-14 16:14:46,762 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-14 16:14:46,768 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-14 16:14:46,768 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-14 16:14:46,768 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-14 16:14:46,768 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-14 16:14:46,768 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-14 16:14:46,769 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-14 16:14:46,769 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-14 16:14:46,769 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-14 16:14:46,769 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-14 16:14:46,769 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-14 16:14:46,769 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-14 16:14:46,770 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-14 16:14:46,770 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-14 16:14:46,770 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-14 16:14:46,787 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-14 16:14:46,787 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-14 16:14:46,787 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-14 16:14:46,787 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-14 16:14:46,788 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-14 16:14:46,789 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-14 16:14:46,789 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-14 16:14:46,789 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-14 16:14:46,789 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-14 16:14:46,789 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-14 16:14:46,789 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:14:46,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:14:46 BoogieIcfgContainer [2018-11-14 16:14:46,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:14:46,806 INFO L168 Benchmark]: Toolchain (without parser) took 13832.69 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 858.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -553.6 MB). Peak memory consumption was 305.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:14:46,807 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:14:46,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:14:46,809 INFO L168 Benchmark]: Boogie Preprocessor took 54.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:14:46,809 INFO L168 Benchmark]: RCFGBuilder took 1064.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-14 16:14:46,810 INFO L168 Benchmark]: TraceAbstraction took 12273.30 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 143.1 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 183.5 MB). Peak memory consumption was 326.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:14:46,814 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 434.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1064.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12273.30 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 143.1 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 183.5 MB). Peak memory consumption was 326.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((3bv32 == blastFlag && !(0bv32 == s__hit)) && 8640bv32 == s__state) || (1bv32 == blastFlag && 8640bv32 == s__state)) || (0bv32 == blastFlag && 8640bv32 == s__state)) || (2bv32 == blastFlag && 8640bv32 == s__state) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag) || (8672bv32 == s__state && 3bv32 == blastFlag)) || ((3bv32 == blastFlag && !(0bv32 == s__hit)) && 8640bv32 == s__state) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((8672bv32 == s__state && 2bv32 == blastFlag) || (0bv32 == blastFlag && 8672bv32 == s__state)) || (8672bv32 == s__state && 3bv32 == blastFlag)) || (1bv32 == blastFlag && 8672bv32 == s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. SAFE Result, 12.1s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 685 SDtfs, 265 SDslu, 335 SDs, 0 SdLazy, 195 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 129 NumberOfFragments, 216 HoareAnnotationTreeSize, 21 FomulaSimplifications, 490 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 25602 SizeOfPredicates, 6 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 205/205 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...