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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:39:36,697 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:39:36,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:39:36,717 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:39:36,718 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:39:36,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:39:36,722 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:39:36,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:39:36,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:39:36,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:39:36,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:39:36,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:39:36,740 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:39:36,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:39:36,743 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:39:36,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:39:36,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:39:36,750 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:39:36,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:39:36,757 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:39:36,758 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:39:36,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:39:36,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:39:36,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:39:36,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:39:36,763 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:39:36,764 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:39:36,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:39:36,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:39:36,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:39:36,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:39:36,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:39:36,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:39:36,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:39:36,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:39:36,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:39:36,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:39:36,797 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:39:36,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:39:36,798 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:39:36,798 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:39:36,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:39:36,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:39:36,799 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:39:36,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:39:36,800 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:39:36,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:39:36,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:39:36,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:39:36,801 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:39:36,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:39:36,801 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:39:36,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:39:36,801 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:39:36,801 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:39:36,802 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:39:36,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:39:36,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:39:36,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:39:36,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:39:36,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:39:36,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:39:36,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:39:36,803 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:39:36,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:39:36,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:39:36,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:39:36,804 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:39:36,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:39:36,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:39:36,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:39:36,872 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:39:36,873 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:39:36,873 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-23 12:39:36,935 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b26f93b8/2309aaf2e3dc49fb821df33cd602a252/FLAGaaf1ff710 [2018-11-23 12:39:37,470 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:39:37,471 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-23 12:39:37,482 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b26f93b8/2309aaf2e3dc49fb821df33cd602a252/FLAGaaf1ff710 [2018-11-23 12:39:37,782 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b26f93b8/2309aaf2e3dc49fb821df33cd602a252 [2018-11-23 12:39:37,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:39:37,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:39:37,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:39:37,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:39:37,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:39:37,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:37" (1/1) ... [2018-11-23 12:39:37,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718bc93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:37, skipping insertion in model container [2018-11-23 12:39:37,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:37" (1/1) ... [2018-11-23 12:39:37,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:39:37,848 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:39:38,082 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:39:38,087 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:39:38,132 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:39:38,149 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:39:38,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38 WrapperNode [2018-11-23 12:39:38,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:39:38,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:39:38,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:39:38,151 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:39:38,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:39:38,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:39:38,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:39:38,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:39:38,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (1/1) ... [2018-11-23 12:39:38,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:39:38,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:39:38,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:39:38,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:39:38,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (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-23 12:39:38,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:39:38,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:39:38,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:39:38,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:39:38,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:39:38,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:39:39,337 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:39:39,337 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:39:39,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:39 BoogieIcfgContainer [2018-11-23 12:39:39,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:39:39,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:39:39,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:39:39,342 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:39:39,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:39:37" (1/3) ... [2018-11-23 12:39:39,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607fadd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:39:39, skipping insertion in model container [2018-11-23 12:39:39,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:38" (2/3) ... [2018-11-23 12:39:39,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607fadd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:39:39, skipping insertion in model container [2018-11-23 12:39:39,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:39" (3/3) ... [2018-11-23 12:39:39,347 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-23 12:39:39,357 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:39:39,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:39:39,385 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:39:39,419 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:39:39,420 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:39:39,420 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:39:39,420 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:39:39,421 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:39:39,421 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:39:39,421 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:39:39,421 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:39:39,421 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:39:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 12:39:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 12:39:39,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:39,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:39,455 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:39,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:39,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2008919768, now seen corresponding path program 1 times [2018-11-23 12:39:39,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:39,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:39,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:39,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 12:39:39,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 12:39:39,681 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {53#true} {53#true} #197#return; {53#true} is VALID [2018-11-23 12:39:39,682 INFO L256 TraceCheckUtils]: 3: Hoare triple {53#true} call #t~ret5 := main(); {53#true} is VALID [2018-11-23 12:39:39,695 INFO L273 TraceCheckUtils]: 4: Hoare triple {53#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~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 := 8466;~blastFlag~0 := 0; {55#(<= main_~blastFlag~0 0)} is VALID [2018-11-23 12:39:39,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {55#(<= main_~blastFlag~0 0)} assume !false; {55#(<= main_~blastFlag~0 0)} is VALID [2018-11-23 12:39:39,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {55#(<= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {54#false} is VALID [2018-11-23 12:39:39,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 12:39:39,726 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-23 12:39:39,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:39,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 12:39:39,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:39,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:39,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:39,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:39,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:39,807 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-23 12:39:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:40,891 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2018-11-23 12:39:40,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:40,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 12:39:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2018-11-23 12:39:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2018-11-23 12:39:40,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2018-11-23 12:39:41,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:41,464 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:39:41,464 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:39:41,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 12:39:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:39:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-23 12:39:41,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:41,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2018-11-23 12:39:41,588 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-23 12:39:41,588 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-23 12:39:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:41,597 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. [2018-11-23 12:39:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2018-11-23 12:39:41,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:41,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:41,599 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-23 12:39:41,600 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-23 12:39:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:41,608 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. [2018-11-23 12:39:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2018-11-23 12:39:41,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:41,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:41,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:41,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 12:39:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2018-11-23 12:39:41,619 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 8 [2018-11-23 12:39:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:41,620 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2018-11-23 12:39:41,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2018-11-23 12:39:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:39:41,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:41,621 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:41,622 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:41,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2066454160, now seen corresponding path program 1 times [2018-11-23 12:39:41,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:41,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:41,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:41,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {532#true} call ULTIMATE.init(); {532#true} is VALID [2018-11-23 12:39:41,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {532#true} assume true; {532#true} is VALID [2018-11-23 12:39:41,712 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {532#true} {532#true} #197#return; {532#true} is VALID [2018-11-23 12:39:41,712 INFO L256 TraceCheckUtils]: 3: Hoare triple {532#true} call #t~ret5 := main(); {532#true} is VALID [2018-11-23 12:39:41,712 INFO L273 TraceCheckUtils]: 4: Hoare triple {532#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~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 := 8466;~blastFlag~0 := 0; {532#true} is VALID [2018-11-23 12:39:41,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {532#true} assume !false; {532#true} is VALID [2018-11-23 12:39:41,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {532#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {532#true} is VALID [2018-11-23 12:39:41,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {532#true} assume 8466 == ~s__state~0; {532#true} is VALID [2018-11-23 12:39:41,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {532#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {534#(<= main_~blastFlag~0 1)} is VALID [2018-11-23 12:39:41,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {534#(<= main_~blastFlag~0 1)} ~s__state~0 := 8496; {534#(<= main_~blastFlag~0 1)} is VALID [2018-11-23 12:39:41,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {534#(<= main_~blastFlag~0 1)} assume !false; {534#(<= main_~blastFlag~0 1)} is VALID [2018-11-23 12:39:41,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {534#(<= main_~blastFlag~0 1)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {533#false} is VALID [2018-11-23 12:39:41,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {533#false} assume !false; {533#false} is VALID [2018-11-23 12:39:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:39:41,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:41,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:41,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:39:41,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:41,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:41,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:41,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:41,789 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 3 states. [2018-11-23 12:39:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:42,222 INFO L93 Difference]: Finished difference Result 161 states and 253 transitions. [2018-11-23 12:39:42,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:42,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:39:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2018-11-23 12:39:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2018-11-23 12:39:42,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2018-11-23 12:39:42,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:42,554 INFO L225 Difference]: With dead ends: 161 [2018-11-23 12:39:42,555 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:39:42,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 12:39:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:39:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-11-23 12:39:42,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:42,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 121 states. [2018-11-23 12:39:42,767 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 121 states. [2018-11-23 12:39:42,767 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 121 states. [2018-11-23 12:39:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:42,775 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-11-23 12:39:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2018-11-23 12:39:42,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:42,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:42,777 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 121 states. [2018-11-23 12:39:42,777 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 121 states. [2018-11-23 12:39:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:42,785 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-11-23 12:39:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2018-11-23 12:39:42,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:42,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:42,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:42,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 12:39:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2018-11-23 12:39:42,795 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 13 [2018-11-23 12:39:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:42,795 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2018-11-23 12:39:42,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2018-11-23 12:39:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:39:42,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:42,797 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:39:42,797 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:42,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1216248382, now seen corresponding path program 1 times [2018-11-23 12:39:42,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:42,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:42,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:42,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:42,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:42,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2018-11-23 12:39:42,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {1177#true} assume true; {1177#true} is VALID [2018-11-23 12:39:42,874 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1177#true} {1177#true} #197#return; {1177#true} is VALID [2018-11-23 12:39:42,874 INFO L256 TraceCheckUtils]: 3: Hoare triple {1177#true} call #t~ret5 := main(); {1177#true} is VALID [2018-11-23 12:39:42,874 INFO L273 TraceCheckUtils]: 4: Hoare triple {1177#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~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 := 8466;~blastFlag~0 := 0; {1177#true} is VALID [2018-11-23 12:39:42,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {1177#true} assume !false; {1177#true} is VALID [2018-11-23 12:39:42,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {1177#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1177#true} is VALID [2018-11-23 12:39:42,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {1177#true} assume 8466 == ~s__state~0; {1177#true} is VALID [2018-11-23 12:39:42,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1177#true} is VALID [2018-11-23 12:39:42,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {1177#true} ~s__state~0 := 8496; {1177#true} is VALID [2018-11-23 12:39:42,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {1177#true} assume !false; {1177#true} is VALID [2018-11-23 12:39:42,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {1177#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1177#true} is VALID [2018-11-23 12:39:42,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {1177#true} assume !(8466 == ~s__state~0); {1177#true} is VALID [2018-11-23 12:39:42,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {1177#true} assume 8496 == ~s__state~0; {1177#true} is VALID [2018-11-23 12:39:42,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {1177#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {1179#(<= main_~blastFlag~0 2)} is VALID [2018-11-23 12:39:42,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {1179#(<= main_~blastFlag~0 2)} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1179#(<= main_~blastFlag~0 2)} is VALID [2018-11-23 12:39:42,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {1179#(<= main_~blastFlag~0 2)} assume !false; {1179#(<= main_~blastFlag~0 2)} is VALID [2018-11-23 12:39:42,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {1179#(<= main_~blastFlag~0 2)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1178#false} is VALID [2018-11-23 12:39:42,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2018-11-23 12:39:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:39:42,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:42,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:42,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:39:42,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:42,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:42,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:42,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:42,919 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand 3 states. [2018-11-23 12:39:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:43,361 INFO L93 Difference]: Finished difference Result 237 states and 369 transitions. [2018-11-23 12:39:43,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:43,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:39:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2018-11-23 12:39:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2018-11-23 12:39:43,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2018-11-23 12:39:43,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:43,592 INFO L225 Difference]: With dead ends: 237 [2018-11-23 12:39:43,592 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 12:39:43,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 12:39:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 12:39:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-23 12:39:43,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:43,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 159 states. [2018-11-23 12:39:43,720 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 159 states. [2018-11-23 12:39:43,721 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 159 states. [2018-11-23 12:39:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:43,729 INFO L93 Difference]: Finished difference Result 159 states and 243 transitions. [2018-11-23 12:39:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2018-11-23 12:39:43,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:43,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:43,731 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 159 states. [2018-11-23 12:39:43,731 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 159 states. [2018-11-23 12:39:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:43,739 INFO L93 Difference]: Finished difference Result 159 states and 243 transitions. [2018-11-23 12:39:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2018-11-23 12:39:43,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:43,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:43,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:43,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 12:39:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2018-11-23 12:39:43,748 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 19 [2018-11-23 12:39:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:43,749 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2018-11-23 12:39:43,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2018-11-23 12:39:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:39:43,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:43,750 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:39:43,751 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:43,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1623728883, now seen corresponding path program 1 times [2018-11-23 12:39:43,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:43,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:43,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:43,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:43,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:43,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {2057#true} call ULTIMATE.init(); {2057#true} is VALID [2018-11-23 12:39:43,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {2057#true} assume true; {2057#true} is VALID [2018-11-23 12:39:43,827 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2057#true} {2057#true} #197#return; {2057#true} is VALID [2018-11-23 12:39:43,827 INFO L256 TraceCheckUtils]: 3: Hoare triple {2057#true} call #t~ret5 := main(); {2057#true} is VALID [2018-11-23 12:39:43,827 INFO L273 TraceCheckUtils]: 4: Hoare triple {2057#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~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 := 8466;~blastFlag~0 := 0; {2057#true} is VALID [2018-11-23 12:39:43,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {2057#true} assume !false; {2057#true} is VALID [2018-11-23 12:39:43,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {2057#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2057#true} is VALID [2018-11-23 12:39:43,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {2057#true} assume 8466 == ~s__state~0; {2057#true} is VALID [2018-11-23 12:39:43,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {2057#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2057#true} is VALID [2018-11-23 12:39:43,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {2057#true} ~s__state~0 := 8496; {2057#true} is VALID [2018-11-23 12:39:43,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {2057#true} assume !false; {2057#true} is VALID [2018-11-23 12:39:43,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {2057#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2057#true} is VALID [2018-11-23 12:39:43,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {2057#true} assume !(8466 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {2057#true} assume 8496 == ~s__state~0; {2057#true} is VALID [2018-11-23 12:39:43,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {2057#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {2057#true} is VALID [2018-11-23 12:39:43,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {2057#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {2057#true} is VALID [2018-11-23 12:39:43,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {2057#true} assume !false; {2057#true} is VALID [2018-11-23 12:39:43,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {2057#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2057#true} is VALID [2018-11-23 12:39:43,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {2057#true} assume !(8466 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {2057#true} assume !(8496 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {2057#true} assume !(8512 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {2057#true} assume !(8528 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {2057#true} assume !(8544 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {2057#true} assume !(8560 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {2057#true} assume !(8576 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,834 INFO L273 TraceCheckUtils]: 25: Hoare triple {2057#true} assume !(8592 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {2057#true} assume !(8608 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {2057#true} assume !(8640 == ~s__state~0); {2057#true} is VALID [2018-11-23 12:39:43,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {2057#true} assume 8656 == ~s__state~0; {2057#true} is VALID [2018-11-23 12:39:43,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {2057#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {2057#true} is VALID [2018-11-23 12:39:43,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {2057#true} ~s__state~0 := 8672; {2059#(<= 8672 main_~s__state~0)} is VALID [2018-11-23 12:39:43,837 INFO L273 TraceCheckUtils]: 31: Hoare triple {2059#(<= 8672 main_~s__state~0)} assume !false; {2059#(<= 8672 main_~s__state~0)} is VALID [2018-11-23 12:39:43,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {2059#(<= 8672 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2058#false} is VALID [2018-11-23 12:39:43,838 INFO L273 TraceCheckUtils]: 33: Hoare triple {2058#false} assume !false; {2058#false} is VALID [2018-11-23 12:39:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:39:43,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:43,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:43,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 12:39:43,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:43,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:43,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:43,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:43,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:43,883 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 3 states. [2018-11-23 12:39:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:44,286 INFO L93 Difference]: Finished difference Result 371 states and 583 transitions. [2018-11-23 12:39:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:44,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 12:39:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-23 12:39:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-23 12:39:44,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2018-11-23 12:39:44,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:44,479 INFO L225 Difference]: With dead ends: 371 [2018-11-23 12:39:44,479 INFO L226 Difference]: Without dead ends: 217 [2018-11-23 12:39:44,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 12:39:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-23 12:39:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2018-11-23 12:39:44,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:44,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 211 states. [2018-11-23 12:39:44,622 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 211 states. [2018-11-23 12:39:44,622 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 211 states. [2018-11-23 12:39:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:44,631 INFO L93 Difference]: Finished difference Result 217 states and 300 transitions. [2018-11-23 12:39:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 300 transitions. [2018-11-23 12:39:44,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:44,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:44,632 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 217 states. [2018-11-23 12:39:44,632 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 217 states. [2018-11-23 12:39:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:44,642 INFO L93 Difference]: Finished difference Result 217 states and 300 transitions. [2018-11-23 12:39:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 300 transitions. [2018-11-23 12:39:44,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:44,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:44,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:44,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-23 12:39:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. [2018-11-23 12:39:44,652 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 295 transitions. Word has length 34 [2018-11-23 12:39:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:44,653 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 295 transitions. [2018-11-23 12:39:44,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 295 transitions. [2018-11-23 12:39:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:39:44,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:44,655 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:39:44,655 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:44,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1694730092, now seen corresponding path program 1 times [2018-11-23 12:39:44,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:44,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:44,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:44,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:44,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:44,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {3278#true} call ULTIMATE.init(); {3278#true} is VALID [2018-11-23 12:39:44,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {3278#true} assume true; {3278#true} is VALID [2018-11-23 12:39:44,796 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3278#true} {3278#true} #197#return; {3278#true} is VALID [2018-11-23 12:39:44,796 INFO L256 TraceCheckUtils]: 3: Hoare triple {3278#true} call #t~ret5 := main(); {3278#true} is VALID [2018-11-23 12:39:44,796 INFO L273 TraceCheckUtils]: 4: Hoare triple {3278#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~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 := 8466;~blastFlag~0 := 0; {3278#true} is VALID [2018-11-23 12:39:44,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {3278#true} assume !false; {3278#true} is VALID [2018-11-23 12:39:44,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {3278#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3278#true} is VALID [2018-11-23 12:39:44,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {3278#true} assume 8466 == ~s__state~0; {3278#true} is VALID [2018-11-23 12:39:44,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {3278#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3278#true} is VALID [2018-11-23 12:39:44,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {3278#true} ~s__state~0 := 8496; {3278#true} is VALID [2018-11-23 12:39:44,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {3278#true} assume !false; {3278#true} is VALID [2018-11-23 12:39:44,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {3278#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3278#true} is VALID [2018-11-23 12:39:44,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {3278#true} assume !(8466 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {3278#true} assume 8496 == ~s__state~0; {3278#true} is VALID [2018-11-23 12:39:44,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {3278#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {3278#true} is VALID [2018-11-23 12:39:44,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {3278#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {3278#true} is VALID [2018-11-23 12:39:44,800 INFO L273 TraceCheckUtils]: 16: Hoare triple {3278#true} assume !false; {3278#true} is VALID [2018-11-23 12:39:44,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {3278#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3278#true} is VALID [2018-11-23 12:39:44,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {3278#true} assume !(8466 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {3278#true} assume !(8496 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {3278#true} assume !(8512 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {3278#true} assume !(8528 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {3278#true} assume !(8544 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {3278#true} assume !(8560 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {3278#true} assume !(8576 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {3278#true} assume !(8592 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {3278#true} assume !(8608 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {3278#true} assume !(8640 == ~s__state~0); {3278#true} is VALID [2018-11-23 12:39:44,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {3278#true} assume 8656 == ~s__state~0; {3278#true} is VALID [2018-11-23 12:39:44,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {3278#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {3280#(<= main_~blastFlag~0 3)} ~s__state~0 := 8672; {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !false; {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,841 INFO L273 TraceCheckUtils]: 33: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8466 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8496 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8512 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8528 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8544 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,844 INFO L273 TraceCheckUtils]: 38: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8560 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8576 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8592 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8608 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8640 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,852 INFO L273 TraceCheckUtils]: 43: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(8656 == ~s__state~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume 8672 == ~s__state~0; {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,854 INFO L273 TraceCheckUtils]: 45: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume !(4 == ~blastFlag~0); {3280#(<= main_~blastFlag~0 3)} is VALID [2018-11-23 12:39:44,854 INFO L273 TraceCheckUtils]: 46: Hoare triple {3280#(<= main_~blastFlag~0 3)} assume 5 == ~blastFlag~0; {3279#false} is VALID [2018-11-23 12:39:44,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {3279#false} assume !false; {3279#false} is VALID [2018-11-23 12:39:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:39:44,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:44,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:44,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 12:39:44,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:44,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:44,926 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-23 12:39:44,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:44,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:44,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:44,927 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. Second operand 3 states. [2018-11-23 12:39:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:45,695 INFO L93 Difference]: Finished difference Result 419 states and 592 transitions. [2018-11-23 12:39:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:45,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 12:39:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-23 12:39:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2018-11-23 12:39:45,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2018-11-23 12:39:46,449 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-23 12:39:46,456 INFO L225 Difference]: With dead ends: 419 [2018-11-23 12:39:46,456 INFO L226 Difference]: Without dead ends: 264 [2018-11-23 12:39:46,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 12:39:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-23 12:39:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-11-23 12:39:46,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:46,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand 262 states. [2018-11-23 12:39:46,632 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 262 states. [2018-11-23 12:39:46,632 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 262 states. [2018-11-23 12:39:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:46,643 INFO L93 Difference]: Finished difference Result 264 states and 370 transitions. [2018-11-23 12:39:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2018-11-23 12:39:46,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:46,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:46,644 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 264 states. [2018-11-23 12:39:46,644 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 264 states. [2018-11-23 12:39:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:46,655 INFO L93 Difference]: Finished difference Result 264 states and 370 transitions. [2018-11-23 12:39:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2018-11-23 12:39:46,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:46,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:46,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:46,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 12:39:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2018-11-23 12:39:46,667 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 48 [2018-11-23 12:39:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:46,668 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2018-11-23 12:39:46,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2018-11-23 12:39:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:39:46,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:46,670 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:39:46,670 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:46,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash 365198397, now seen corresponding path program 1 times [2018-11-23 12:39:46,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:46,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:46,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:46,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:46,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:46,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {4712#true} call ULTIMATE.init(); {4712#true} is VALID [2018-11-23 12:39:46,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {4712#true} assume true; {4712#true} is VALID [2018-11-23 12:39:46,783 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4712#true} {4712#true} #197#return; {4712#true} is VALID [2018-11-23 12:39:46,783 INFO L256 TraceCheckUtils]: 3: Hoare triple {4712#true} call #t~ret5 := main(); {4712#true} is VALID [2018-11-23 12:39:46,783 INFO L273 TraceCheckUtils]: 4: Hoare triple {4712#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~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 := 8466;~blastFlag~0 := 0; {4712#true} is VALID [2018-11-23 12:39:46,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {4712#true} assume !false; {4712#true} is VALID [2018-11-23 12:39:46,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {4712#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {4712#true} is VALID [2018-11-23 12:39:46,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {4712#true} assume 8466 == ~s__state~0; {4712#true} is VALID [2018-11-23 12:39:46,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {4712#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4712#true} is VALID [2018-11-23 12:39:46,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {4712#true} ~s__state~0 := 8496; {4712#true} is VALID [2018-11-23 12:39:46,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {4712#true} assume !false; {4712#true} is VALID [2018-11-23 12:39:46,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {4712#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {4712#true} is VALID [2018-11-23 12:39:46,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {4712#true} assume !(8466 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {4712#true} assume 8496 == ~s__state~0; {4712#true} is VALID [2018-11-23 12:39:46,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {4712#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {4712#true} is VALID [2018-11-23 12:39:46,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {4712#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {4712#true} is VALID [2018-11-23 12:39:46,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {4712#true} assume !false; {4712#true} is VALID [2018-11-23 12:39:46,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {4712#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {4712#true} is VALID [2018-11-23 12:39:46,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {4712#true} assume !(8466 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {4712#true} assume !(8496 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {4712#true} assume !(8512 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {4712#true} assume !(8528 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {4712#true} assume !(8544 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {4712#true} assume !(8560 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {4712#true} assume !(8576 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {4712#true} assume !(8592 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {4712#true} assume !(8608 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {4712#true} assume !(8640 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,789 INFO L273 TraceCheckUtils]: 28: Hoare triple {4712#true} assume 8656 == ~s__state~0; {4712#true} is VALID [2018-11-23 12:39:46,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {4712#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {4712#true} is VALID [2018-11-23 12:39:46,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {4712#true} ~s__state~0 := 8672; {4712#true} is VALID [2018-11-23 12:39:46,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {4712#true} assume !false; {4712#true} is VALID [2018-11-23 12:39:46,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {4712#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {4712#true} is VALID [2018-11-23 12:39:46,790 INFO L273 TraceCheckUtils]: 33: Hoare triple {4712#true} assume !(8466 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {4712#true} assume !(8496 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,791 INFO L273 TraceCheckUtils]: 35: Hoare triple {4712#true} assume !(8512 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {4712#true} assume !(8528 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,791 INFO L273 TraceCheckUtils]: 37: Hoare triple {4712#true} assume !(8544 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,791 INFO L273 TraceCheckUtils]: 38: Hoare triple {4712#true} assume !(8560 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,793 INFO L273 TraceCheckUtils]: 39: Hoare triple {4712#true} assume !(8576 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,793 INFO L273 TraceCheckUtils]: 40: Hoare triple {4712#true} assume !(8592 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,793 INFO L273 TraceCheckUtils]: 41: Hoare triple {4712#true} assume !(8608 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {4712#true} assume !(8640 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,794 INFO L273 TraceCheckUtils]: 43: Hoare triple {4712#true} assume !(8656 == ~s__state~0); {4712#true} is VALID [2018-11-23 12:39:46,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {4712#true} assume 8672 == ~s__state~0; {4712#true} is VALID [2018-11-23 12:39:46,795 INFO L273 TraceCheckUtils]: 45: Hoare triple {4712#true} assume !(4 == ~blastFlag~0); {4712#true} is VALID [2018-11-23 12:39:46,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {4712#true} assume !(5 == ~blastFlag~0); {4712#true} is VALID [2018-11-23 12:39:46,796 INFO L273 TraceCheckUtils]: 47: Hoare triple {4712#true} assume 0 != ~s__hit~0;~s__state~0 := 8640; {4714#(<= 8640 main_~s__state~0)} is VALID [2018-11-23 12:39:46,796 INFO L273 TraceCheckUtils]: 48: Hoare triple {4714#(<= 8640 main_~s__state~0)} assume !false; {4714#(<= 8640 main_~s__state~0)} is VALID [2018-11-23 12:39:46,798 INFO L273 TraceCheckUtils]: 49: Hoare triple {4714#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {4713#false} is VALID [2018-11-23 12:39:46,798 INFO L273 TraceCheckUtils]: 50: Hoare triple {4713#false} assume !false; {4713#false} is VALID [2018-11-23 12:39:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:39:46,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:46,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:46,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 12:39:46,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:46,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:46,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:46,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:46,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:46,851 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 3 states. [2018-11-23 12:39:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:47,832 INFO L93 Difference]: Finished difference Result 527 states and 756 transitions. [2018-11-23 12:39:47,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:47,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 12:39:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:39:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:39:47,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-23 12:39:48,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:48,208 INFO L225 Difference]: With dead ends: 527 [2018-11-23 12:39:48,208 INFO L226 Difference]: Without dead ends: 192 [2018-11-23 12:39:48,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 12:39:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-23 12:39:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-11-23 12:39:48,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:48,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 189 states. [2018-11-23 12:39:48,522 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 189 states. [2018-11-23 12:39:48,522 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 189 states. [2018-11-23 12:39:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:48,529 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2018-11-23 12:39:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 253 transitions. [2018-11-23 12:39:48,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:48,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:48,530 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 192 states. [2018-11-23 12:39:48,530 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 192 states. [2018-11-23 12:39:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:48,535 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2018-11-23 12:39:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 253 transitions. [2018-11-23 12:39:48,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:48,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:48,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:48,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 12:39:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-11-23 12:39:48,541 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 51 [2018-11-23 12:39:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:48,541 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-11-23 12:39:48,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-11-23 12:39:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:39:48,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:39:48,543 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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-23 12:39:48,543 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:39:48,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:48,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1939547864, now seen corresponding path program 1 times [2018-11-23 12:39:48,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:39:48,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:39:48,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:48,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:39:48,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:39:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:39:48,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {6018#true} call ULTIMATE.init(); {6018#true} is VALID [2018-11-23 12:39:48,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {6018#true} assume true; {6018#true} is VALID [2018-11-23 12:39:48,745 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6018#true} {6018#true} #197#return; {6018#true} is VALID [2018-11-23 12:39:48,746 INFO L256 TraceCheckUtils]: 3: Hoare triple {6018#true} call #t~ret5 := main(); {6018#true} is VALID [2018-11-23 12:39:48,746 INFO L273 TraceCheckUtils]: 4: Hoare triple {6018#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~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 := 8466;~blastFlag~0 := 0; {6018#true} is VALID [2018-11-23 12:39:48,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {6018#true} assume !false; {6018#true} is VALID [2018-11-23 12:39:48,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {6018#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {6018#true} is VALID [2018-11-23 12:39:48,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {6018#true} assume 8466 == ~s__state~0; {6018#true} is VALID [2018-11-23 12:39:48,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {6018#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {6018#true} is VALID [2018-11-23 12:39:48,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {6018#true} ~s__state~0 := 8496; {6018#true} is VALID [2018-11-23 12:39:48,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {6018#true} assume !false; {6018#true} is VALID [2018-11-23 12:39:48,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {6018#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {6018#true} is VALID [2018-11-23 12:39:48,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {6018#true} assume !(8466 == ~s__state~0); {6018#true} is VALID [2018-11-23 12:39:48,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {6018#true} assume 8496 == ~s__state~0; {6018#true} is VALID [2018-11-23 12:39:48,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {6018#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {6018#true} is VALID [2018-11-23 12:39:48,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {6018#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !false; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8496 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8528 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8544 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8560 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8576 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8592 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,758 INFO L273 TraceCheckUtils]: 26: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8608 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8640 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume 8656 == ~s__state~0; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,760 INFO L273 TraceCheckUtils]: 29: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,760 INFO L273 TraceCheckUtils]: 30: Hoare triple {6020#(not (= 0 main_~s__hit~0))} ~s__state~0 := 8672; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,767 INFO L273 TraceCheckUtils]: 31: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !false; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,768 INFO L273 TraceCheckUtils]: 32: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,772 INFO L273 TraceCheckUtils]: 33: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,772 INFO L273 TraceCheckUtils]: 34: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8496 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,772 INFO L273 TraceCheckUtils]: 35: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,773 INFO L273 TraceCheckUtils]: 36: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8528 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,773 INFO L273 TraceCheckUtils]: 37: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8544 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,774 INFO L273 TraceCheckUtils]: 38: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8560 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,774 INFO L273 TraceCheckUtils]: 39: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8576 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,774 INFO L273 TraceCheckUtils]: 40: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8592 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8608 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,776 INFO L273 TraceCheckUtils]: 42: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8640 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,776 INFO L273 TraceCheckUtils]: 43: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8656 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,777 INFO L273 TraceCheckUtils]: 44: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume 8672 == ~s__state~0; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,777 INFO L273 TraceCheckUtils]: 45: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(4 == ~blastFlag~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,778 INFO L273 TraceCheckUtils]: 46: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(5 == ~blastFlag~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,779 INFO L273 TraceCheckUtils]: 47: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,779 INFO L273 TraceCheckUtils]: 48: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !false; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,780 INFO L273 TraceCheckUtils]: 49: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,780 INFO L273 TraceCheckUtils]: 50: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8466 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,788 INFO L273 TraceCheckUtils]: 51: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8496 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,788 INFO L273 TraceCheckUtils]: 52: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8512 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,789 INFO L273 TraceCheckUtils]: 53: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8528 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,790 INFO L273 TraceCheckUtils]: 54: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8544 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,790 INFO L273 TraceCheckUtils]: 55: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8560 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,791 INFO L273 TraceCheckUtils]: 56: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8576 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,791 INFO L273 TraceCheckUtils]: 57: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8592 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,793 INFO L273 TraceCheckUtils]: 58: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(8608 == ~s__state~0); {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,793 INFO L273 TraceCheckUtils]: 59: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume 8640 == ~s__state~0; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,794 INFO L273 TraceCheckUtils]: 60: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {6020#(not (= 0 main_~s__hit~0))} is VALID [2018-11-23 12:39:48,796 INFO L273 TraceCheckUtils]: 61: Hoare triple {6020#(not (= 0 main_~s__hit~0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {6019#false} is VALID [2018-11-23 12:39:48,796 INFO L273 TraceCheckUtils]: 62: Hoare triple {6019#false} assume !false; {6019#false} is VALID [2018-11-23 12:39:48,797 INFO L273 TraceCheckUtils]: 63: Hoare triple {6019#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {6019#false} is VALID [2018-11-23 12:39:48,797 INFO L273 TraceCheckUtils]: 64: Hoare triple {6019#false} assume !(8466 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,797 INFO L273 TraceCheckUtils]: 65: Hoare triple {6019#false} assume !(8496 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,798 INFO L273 TraceCheckUtils]: 66: Hoare triple {6019#false} assume !(8512 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,798 INFO L273 TraceCheckUtils]: 67: Hoare triple {6019#false} assume !(8528 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,798 INFO L273 TraceCheckUtils]: 68: Hoare triple {6019#false} assume !(8544 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,799 INFO L273 TraceCheckUtils]: 69: Hoare triple {6019#false} assume !(8560 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,799 INFO L273 TraceCheckUtils]: 70: Hoare triple {6019#false} assume !(8576 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,799 INFO L273 TraceCheckUtils]: 71: Hoare triple {6019#false} assume !(8592 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,800 INFO L273 TraceCheckUtils]: 72: Hoare triple {6019#false} assume !(8608 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,800 INFO L273 TraceCheckUtils]: 73: Hoare triple {6019#false} assume !(8640 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,800 INFO L273 TraceCheckUtils]: 74: Hoare triple {6019#false} assume !(8656 == ~s__state~0); {6019#false} is VALID [2018-11-23 12:39:48,800 INFO L273 TraceCheckUtils]: 75: Hoare triple {6019#false} assume 8672 == ~s__state~0; {6019#false} is VALID [2018-11-23 12:39:48,801 INFO L273 TraceCheckUtils]: 76: Hoare triple {6019#false} assume !(4 == ~blastFlag~0); {6019#false} is VALID [2018-11-23 12:39:48,801 INFO L273 TraceCheckUtils]: 77: Hoare triple {6019#false} assume 5 == ~blastFlag~0; {6019#false} is VALID [2018-11-23 12:39:48,801 INFO L273 TraceCheckUtils]: 78: Hoare triple {6019#false} assume !false; {6019#false} is VALID [2018-11-23 12:39:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 12:39:48,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:39:48,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:39:48,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-23 12:39:48,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:39:48,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:39:48,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:48,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:39:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:39:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:39:48,885 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-11-23 12:39:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:49,288 INFO L93 Difference]: Finished difference Result 310 states and 379 transitions. [2018-11-23 12:39:49,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:39:49,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-23 12:39:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:39:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 12:39:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:39:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 12:39:49,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2018-11-23 12:39:49,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:39:49,867 INFO L225 Difference]: With dead ends: 310 [2018-11-23 12:39:49,867 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:39:49,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 12:39:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:39:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:39:49,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:39:49,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:49,870 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:49,870 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:49,870 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:39:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:39:49,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:49,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:49,871 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:49,871 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:39:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:39:49,871 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:39:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:39:49,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:49,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:39:49,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:39:49,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:39:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:39:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:39:49,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2018-11-23 12:39:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:39:49,872 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:39:49,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:39:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:39:49,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:39:49,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:39:50,355 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:39:50,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:39:50,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:39:50,355 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:39:50,355 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:39:50,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:39:50,355 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 218) no Hoare annotation was computed. [2018-11-23 12:39:50,355 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 186) no Hoare annotation was computed. [2018-11-23 12:39:50,356 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 190) no Hoare annotation was computed. [2018-11-23 12:39:50,356 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 12:39:50,356 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 194) no Hoare annotation was computed. [2018-11-23 12:39:50,356 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 12:39:50,356 INFO L444 ceAbstractionStarter]: At program point L177(lines 23 212) the Hoare annotation is: (let ((.cse0 (<= main_~blastFlag~0 3))) (or (and (<= 8640 main_~s__state~0) .cse0 (not (= 0 main_~s__hit~0))) (<= main_~blastFlag~0 2) (and .cse0 (<= 8672 main_~s__state~0)))) [2018-11-23 12:39:50,356 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2018-11-23 12:39:50,356 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2018-11-23 12:39:50,357 INFO L444 ceAbstractionStarter]: At program point L70(lines 69 186) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2018-11-23 12:39:50,357 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 202) no Hoare annotation was computed. [2018-11-23 12:39:50,357 INFO L444 ceAbstractionStarter]: At program point L62(lines 61 190) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,357 INFO L444 ceAbstractionStarter]: At program point L54(lines 53 194) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,357 INFO L444 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,357 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 79 81) no Hoare annotation was computed. [2018-11-23 12:39:50,357 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 218) no Hoare annotation was computed. [2018-11-23 12:39:50,357 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 12:39:50,357 INFO L444 ceAbstractionStarter]: At program point L38(lines 37 202) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,358 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 205) no Hoare annotation was computed. [2018-11-23 12:39:50,358 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 218) the Hoare annotation is: true [2018-11-23 12:39:50,358 INFO L444 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,358 INFO L444 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,358 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 163 165) no Hoare annotation was computed. [2018-11-23 12:39:50,358 INFO L444 ceAbstractionStarter]: At program point L31(lines 30 205) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,358 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2018-11-23 12:39:50,359 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2018-11-23 12:39:50,359 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 188) no Hoare annotation was computed. [2018-11-23 12:39:50,359 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 192) no Hoare annotation was computed. [2018-11-23 12:39:50,359 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-23 12:39:50,359 INFO L451 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2018-11-23 12:39:50,359 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2018-11-23 12:39:50,359 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 196) no Hoare annotation was computed. [2018-11-23 12:39:50,359 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2018-11-23 12:39:50,359 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-11-23 12:39:50,360 INFO L444 ceAbstractionStarter]: At program point L74(lines 73 184) the Hoare annotation is: (and (<= main_~blastFlag~0 3) (<= 8672 main_~s__state~0)) [2018-11-23 12:39:50,360 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 200) no Hoare annotation was computed. [2018-11-23 12:39:50,360 INFO L444 ceAbstractionStarter]: At program point L66(lines 65 188) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2018-11-23 12:39:50,360 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 204) no Hoare annotation was computed. [2018-11-23 12:39:50,360 INFO L444 ceAbstractionStarter]: At program point L58(lines 57 192) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,360 INFO L444 ceAbstractionStarter]: At program point L50(lines 49 196) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,361 INFO L444 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2018-11-23 12:39:50,361 INFO L444 ceAbstractionStarter]: At program point L42(lines 41 200) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,361 INFO L444 ceAbstractionStarter]: At program point L34(lines 33 204) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 12:39:50,361 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2018-11-23 12:39:50,363 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:39:50,382 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:39:50,382 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:39:50,382 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 12:39:50,382 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:39:50,382 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:39:50,382 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 12:39:50,383 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 12:39:50,383 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:39:50,383 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:39:50,383 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:39:50,383 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 12:39:50,383 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 12:39:50,383 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:39:50,383 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 12:39:50,384 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 12:39:50,397 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:39:50,397 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:39:50,410 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 12:39:50,410 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 12:39:50,410 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 12:39:50,430 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 12:39:50,430 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 12:39:50,430 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 12:39:50,430 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 12:39:50,439 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-23 12:39:50,439 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-23 12:39:50,439 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 12:39:50,440 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 12:39:50,440 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 12:39:50,452 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 12:39:50,452 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-23 12:39:50,452 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-23 12:39:50,452 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 12:39:50,453 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 12:39:50,465 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 12:39:50,465 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 12:39:50,478 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 12:39:50,478 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 12:39:50,497 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-23 12:39:50,497 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-23 12:39:50,497 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-23 12:39:50,497 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-23 12:39:50,497 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 12:39:50,498 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 12:39:50,498 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-23 12:39:50,498 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-23 12:39:50,498 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-23 12:39:50,498 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-23 12:39:50,498 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-23 12:39:50,498 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-23 12:39:50,498 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-23 12:39:50,499 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-23 12:39:50,499 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-23 12:39:50,499 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-23 12:39:50,499 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-23 12:39:50,499 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-23 12:39:50,499 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-23 12:39:50,499 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:39:50,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:39:50 BoogieIcfgContainer [2018-11-23 12:39:50,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:39:50,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:39:50,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:39:50,515 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:39:50,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:39" (3/4) ... [2018-11-23 12:39:50,520 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:39:50,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:39:50,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:39:50,533 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:39:50,534 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:39:50,534 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:39:50,636 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c-witness.graphml [2018-11-23 12:39:50,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:39:50,637 INFO L168 Benchmark]: Toolchain (without parser) took 12845.37 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 847.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -683.7 MB). Peak memory consumption was 163.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:39:50,641 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-23 12:39:50,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.84 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-23 12:39:50,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.29 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-23 12:39:50,642 INFO L168 Benchmark]: Boogie Preprocessor took 31.95 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-23 12:39:50,644 INFO L168 Benchmark]: RCFGBuilder took 1130.57 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:39:50,645 INFO L168 Benchmark]: TraceAbstraction took 11175.37 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 140.5 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 187.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:39:50,646 INFO L168 Benchmark]: Witness Printer took 121.30 ms. Allocated memory is still 2.4 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:39:50,648 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 356.84 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 Procedure Inliner took 24.29 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. * Boogie Preprocessor took 31.95 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 1130.57 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11175.37 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 140.5 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 187.4 MB. Max. memory is 7.1 GB. * Witness Printer took 121.30 ms. Allocated memory is still 2.4 GB. Free memory is still 2.1 GB. There was no memory consumed. 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: blastFlag <= 2 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || blastFlag <= 2) || (blastFlag <= 3 && 8672 <= s__state) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: blastFlag <= 3 && 8672 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 10.9s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 457 SDtfs, 250 SDslu, 321 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=5, 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 86 NumberOfFragments, 106 HoareAnnotationTreeSize, 21 FomulaSimplifications, 585 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 25301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 202/202 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...