java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:15:48,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:15:48,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:15:48,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:15:48,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:15:48,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:15:48,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:15:48,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:15:48,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:15:48,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:15:48,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:15:48,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:15:48,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:15:48,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:15:48,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:15:48,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:15:48,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:15:48,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:15:48,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:15:48,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:15:48,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:15:48,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:15:48,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:15:48,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:15:48,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:15:48,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:15:48,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:15:48,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:15:48,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:15:48,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:15:48,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:15:48,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:15:48,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:15:48,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:15:48,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:15:48,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:15:48,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:15:48,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:15:48,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:15:48,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:15:48,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:15:48,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 16:15:48,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:15:48,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:15:48,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:15:48,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:15:48,096 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:15:48,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:15:48,096 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:15:48,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:15:48,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:15:48,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:15:48,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:15:48,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:15:48,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:15:48,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:15:48,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:15:48,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:15:48,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:15:48,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:15:48,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:15:48,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:15:48,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:15:48,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:15:48,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:15:48,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:15:48,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:15:48,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:15:48,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:15:48,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:15:48,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:15:48,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:15:48,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:15:48,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:15:48,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:15:48,159 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:15:48,161 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-10-02 16:15:48,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9478ebfdd/8344e21ec3694981888c484b09bbc74d/FLAG1362a72b8 [2019-10-02 16:15:48,794 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:15:48,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-10-02 16:15:48,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9478ebfdd/8344e21ec3694981888c484b09bbc74d/FLAG1362a72b8 [2019-10-02 16:15:49,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9478ebfdd/8344e21ec3694981888c484b09bbc74d [2019-10-02 16:15:49,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:15:49,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:15:49,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:15:49,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:15:49,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:15:49,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d840b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49, skipping insertion in model container [2019-10-02 16:15:49,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:15:49,172 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:15:49,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:15:49,516 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:15:49,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:15:49,590 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:15:49,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49 WrapperNode [2019-10-02 16:15:49,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:15:49,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:15:49,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:15:49,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:15:49,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (1/1) ... [2019-10-02 16:15:49,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:15:49,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:15:49,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:15:49,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:15:49,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (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 [2019-10-02 16:15:49,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:15:49,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:15:49,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-02 16:15:49,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:15:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:15:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 16:15:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:15:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 16:15:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 16:15:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-02 16:15:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:15:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:15:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:15:49,880 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 16:15:50,442 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-02 16:15:50,442 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-02 16:15:50,454 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:15:50,454 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 16:15:50,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:15:50 BoogieIcfgContainer [2019-10-02 16:15:50,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:15:50,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:15:50,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:15:50,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:15:50,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:15:49" (1/3) ... [2019-10-02 16:15:50,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f04eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:15:50, skipping insertion in model container [2019-10-02 16:15:50,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:49" (2/3) ... [2019-10-02 16:15:50,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f04eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:15:50, skipping insertion in model container [2019-10-02 16:15:50,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:15:50" (3/3) ... [2019-10-02 16:15:50,469 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-10-02 16:15:50,479 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:15:50,489 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:15:50,507 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:15:50,537 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:15:50,538 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:15:50,538 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:15:50,538 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:15:50,538 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:15:50,539 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:15:50,539 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:15:50,539 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:15:50,539 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:15:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-10-02 16:15:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 16:15:50,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:50,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:50,574 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:50,580 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-10-02 16:15:50,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:50,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:50,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:15:50,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:50,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:50,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:50,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:50,860 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-10-02 16:15:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:50,973 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-10-02 16:15:50,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:50,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 16:15:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:50,989 INFO L225 Difference]: With dead ends: 377 [2019-10-02 16:15:50,990 INFO L226 Difference]: Without dead ends: 220 [2019-10-02 16:15:50,994 INFO L640 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 [2019-10-02 16:15:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-02 16:15:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-02 16:15:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-02 16:15:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-10-02 16:15:51,056 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-10-02 16:15:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:51,057 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-10-02 16:15:51,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-10-02 16:15:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 16:15:51,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:51,061 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:51,061 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2019-10-02 16:15:51,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:51,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:51,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:51,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:51,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:15:51,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:51,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:51,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:51,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:51,168 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-10-02 16:15:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:51,398 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2019-10-02 16:15:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:51,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 16:15:51,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:51,402 INFO L225 Difference]: With dead ends: 472 [2019-10-02 16:15:51,402 INFO L226 Difference]: Without dead ends: 264 [2019-10-02 16:15:51,404 INFO L640 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 [2019-10-02 16:15:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-02 16:15:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2019-10-02 16:15:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-02 16:15:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-10-02 16:15:51,428 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-10-02 16:15:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:51,428 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-10-02 16:15:51,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-10-02 16:15:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 16:15:51,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:51,432 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:51,432 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1571737336, now seen corresponding path program 1 times [2019-10-02 16:15:51,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:51,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:51,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:51,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:51,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:51,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:51,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:51,569 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-10-02 16:15:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:51,798 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-10-02 16:15:51,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:51,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 16:15:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:51,801 INFO L225 Difference]: With dead ends: 598 [2019-10-02 16:15:51,801 INFO L226 Difference]: Without dead ends: 354 [2019-10-02 16:15:51,804 INFO L640 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 [2019-10-02 16:15:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-02 16:15:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-10-02 16:15:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-02 16:15:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-10-02 16:15:51,826 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-10-02 16:15:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:51,826 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-10-02 16:15:51,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-10-02 16:15:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 16:15:51,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:51,830 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:51,831 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash -233700998, now seen corresponding path program 1 times [2019-10-02 16:15:51,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:51,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:51,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:51,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:51,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:51,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:51,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:51,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:51,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:51,912 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-10-02 16:15:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:52,061 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-10-02 16:15:52,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:52,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 16:15:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:52,065 INFO L225 Difference]: With dead ends: 708 [2019-10-02 16:15:52,065 INFO L226 Difference]: Without dead ends: 384 [2019-10-02 16:15:52,066 INFO L640 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 [2019-10-02 16:15:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-02 16:15:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-10-02 16:15:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-02 16:15:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-10-02 16:15:52,085 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-10-02 16:15:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:52,086 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-10-02 16:15:52,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-10-02 16:15:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 16:15:52,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:52,090 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:52,090 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:52,091 INFO L82 PathProgramCache]: Analyzing trace with hash -343872958, now seen corresponding path program 1 times [2019-10-02 16:15:52,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:52,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:52,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:52,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:52,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:52,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:52,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:52,186 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-10-02 16:15:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:52,382 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-10-02 16:15:52,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:52,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-02 16:15:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:52,386 INFO L225 Difference]: With dead ends: 842 [2019-10-02 16:15:52,386 INFO L226 Difference]: Without dead ends: 478 [2019-10-02 16:15:52,388 INFO L640 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 [2019-10-02 16:15:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-02 16:15:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-10-02 16:15:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-02 16:15:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-10-02 16:15:52,416 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-10-02 16:15:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:52,418 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-10-02 16:15:52,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-10-02 16:15:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:15:52,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:52,423 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:52,424 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:52,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1570407527, now seen corresponding path program 1 times [2019-10-02 16:15:52,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:52,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:52,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:52,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 16:15:52,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:52,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:52,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:52,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:52,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:52,529 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-10-02 16:15:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:52,680 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-10-02 16:15:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:52,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-02 16:15:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:52,686 INFO L225 Difference]: With dead ends: 940 [2019-10-02 16:15:52,686 INFO L226 Difference]: Without dead ends: 500 [2019-10-02 16:15:52,688 INFO L640 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 [2019-10-02 16:15:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-02 16:15:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-10-02 16:15:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-02 16:15:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-10-02 16:15:52,710 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-10-02 16:15:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:52,712 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-10-02 16:15:52,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-10-02 16:15:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 16:15:52,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:52,715 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:52,715 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:52,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1356861727, now seen corresponding path program 1 times [2019-10-02 16:15:52,716 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:52,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:52,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:52,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:52,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:15:52,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:52,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:52,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:52,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:52,815 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-10-02 16:15:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:52,855 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-10-02 16:15:52,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:52,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-02 16:15:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:52,861 INFO L225 Difference]: With dead ends: 976 [2019-10-02 16:15:52,861 INFO L226 Difference]: Without dead ends: 734 [2019-10-02 16:15:52,862 INFO L640 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 [2019-10-02 16:15:52,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-02 16:15:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-10-02 16:15:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-10-02 16:15:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-10-02 16:15:52,884 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-10-02 16:15:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:52,885 INFO L475 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-10-02 16:15:52,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-10-02 16:15:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 16:15:52,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:52,887 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:52,887 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1774863991, now seen corresponding path program 1 times [2019-10-02 16:15:52,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:52,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 16:15:52,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:52,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:52,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:52,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:52,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:52,966 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-10-02 16:15:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:53,009 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-10-02 16:15:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:53,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-02 16:15:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:53,015 INFO L225 Difference]: With dead ends: 976 [2019-10-02 16:15:53,015 INFO L226 Difference]: Without dead ends: 974 [2019-10-02 16:15:53,016 INFO L640 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 [2019-10-02 16:15:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-02 16:15:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-10-02 16:15:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-02 16:15:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-10-02 16:15:53,046 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-10-02 16:15:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:53,046 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-10-02 16:15:53,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-10-02 16:15:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 16:15:53,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:53,051 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:53,051 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash 600728947, now seen corresponding path program 1 times [2019-10-02 16:15:53,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:53,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:53,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:53,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:53,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 16:15:53,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:53,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:53,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:53,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:53,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:53,135 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-10-02 16:15:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:53,336 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-10-02 16:15:53,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:53,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-02 16:15:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:53,343 INFO L225 Difference]: With dead ends: 2140 [2019-10-02 16:15:53,343 INFO L226 Difference]: Without dead ends: 1170 [2019-10-02 16:15:53,346 INFO L640 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 [2019-10-02 16:15:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-10-02 16:15:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-10-02 16:15:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-02 16:15:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-10-02 16:15:53,379 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 154 [2019-10-02 16:15:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:53,379 INFO L475 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-10-02 16:15:53,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-10-02 16:15:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 16:15:53,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:53,384 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:53,384 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:53,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1176011842, now seen corresponding path program 1 times [2019-10-02 16:15:53,385 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:53,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:53,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:53,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:53,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 16:15:53,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:53,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:53,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:53,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:53,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:53,452 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-10-02 16:15:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:53,596 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-10-02 16:15:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:53,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-02 16:15:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:53,603 INFO L225 Difference]: With dead ends: 2354 [2019-10-02 16:15:53,603 INFO L226 Difference]: Without dead ends: 1236 [2019-10-02 16:15:53,605 INFO L640 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 [2019-10-02 16:15:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-02 16:15:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-10-02 16:15:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-02 16:15:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-10-02 16:15:53,640 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 190 [2019-10-02 16:15:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:53,640 INFO L475 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-10-02 16:15:53,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-10-02 16:15:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 16:15:53,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:53,646 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:53,646 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash -717257595, now seen corresponding path program 1 times [2019-10-02 16:15:53,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:53,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:53,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 16:15:53,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:53,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:53,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:53,733 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-10-02 16:15:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:53,866 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-10-02 16:15:53,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:53,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-10-02 16:15:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:53,874 INFO L225 Difference]: With dead ends: 2544 [2019-10-02 16:15:53,875 INFO L226 Difference]: Without dead ends: 1334 [2019-10-02 16:15:53,879 INFO L640 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 [2019-10-02 16:15:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-10-02 16:15:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-10-02 16:15:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-02 16:15:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-10-02 16:15:53,921 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 211 [2019-10-02 16:15:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:53,921 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-10-02 16:15:53,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-10-02 16:15:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 16:15:53,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:53,927 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:53,927 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:53,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1079909240, now seen corresponding path program 1 times [2019-10-02 16:15:53,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:53,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:53,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-02 16:15:54,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:54,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:54,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:54,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:54,032 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-10-02 16:15:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:54,219 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-10-02 16:15:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:54,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-02 16:15:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:54,227 INFO L225 Difference]: With dead ends: 2752 [2019-10-02 16:15:54,227 INFO L226 Difference]: Without dead ends: 1442 [2019-10-02 16:15:54,230 INFO L640 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 [2019-10-02 16:15:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-10-02 16:15:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-10-02 16:15:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-02 16:15:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-10-02 16:15:54,265 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 235 [2019-10-02 16:15:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:54,266 INFO L475 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-10-02 16:15:54,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-10-02 16:15:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 16:15:54,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:54,272 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:54,272 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1213171786, now seen corresponding path program 1 times [2019-10-02 16:15:54,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:54,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-02 16:15:54,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:54,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:54,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:54,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:54,360 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-10-02 16:15:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:54,542 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-10-02 16:15:54,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:54,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-02 16:15:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:54,553 INFO L225 Difference]: With dead ends: 2992 [2019-10-02 16:15:54,553 INFO L226 Difference]: Without dead ends: 1570 [2019-10-02 16:15:54,558 INFO L640 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 [2019-10-02 16:15:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-02 16:15:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-10-02 16:15:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-02 16:15:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-10-02 16:15:54,618 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 235 [2019-10-02 16:15:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:54,619 INFO L475 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-10-02 16:15:54,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-10-02 16:15:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 16:15:54,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:54,630 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:54,631 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1569112328, now seen corresponding path program 1 times [2019-10-02 16:15:54,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:54,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-02 16:15:54,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:54,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:54,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:54,867 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-10-02 16:15:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:54,947 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-10-02 16:15:54,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:54,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-10-02 16:15:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:54,967 INFO L225 Difference]: With dead ends: 4646 [2019-10-02 16:15:54,967 INFO L226 Difference]: Without dead ends: 3100 [2019-10-02 16:15:54,973 INFO L640 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 [2019-10-02 16:15:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-10-02 16:15:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-10-02 16:15:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-10-02 16:15:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-10-02 16:15:55,074 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 265 [2019-10-02 16:15:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:55,075 INFO L475 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-10-02 16:15:55,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-10-02 16:15:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 16:15:55,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:55,091 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:55,091 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:55,092 INFO L82 PathProgramCache]: Analyzing trace with hash 432773942, now seen corresponding path program 1 times [2019-10-02 16:15:55,092 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:55,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:55,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-02 16:15:55,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:55,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:55,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:55,254 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-10-02 16:15:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:55,489 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-10-02 16:15:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:55,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-10-02 16:15:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:55,508 INFO L225 Difference]: With dead ends: 6484 [2019-10-02 16:15:55,509 INFO L226 Difference]: Without dead ends: 3398 [2019-10-02 16:15:55,518 INFO L640 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 [2019-10-02 16:15:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-02 16:15:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-10-02 16:15:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-10-02 16:15:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-10-02 16:15:55,609 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 265 [2019-10-02 16:15:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:55,610 INFO L475 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-10-02 16:15:55,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-10-02 16:15:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 16:15:55,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:55,622 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:55,622 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash -764797682, now seen corresponding path program 1 times [2019-10-02 16:15:55,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:55,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:55,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:55,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:55,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-10-02 16:15:55,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:55,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:55,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:55,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:55,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:55,801 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-10-02 16:15:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:56,017 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-10-02 16:15:56,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:56,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-10-02 16:15:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:56,039 INFO L225 Difference]: With dead ends: 6900 [2019-10-02 16:15:56,039 INFO L226 Difference]: Without dead ends: 3530 [2019-10-02 16:15:56,049 INFO L640 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 [2019-10-02 16:15:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-10-02 16:15:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-10-02 16:15:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-10-02 16:15:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-10-02 16:15:56,168 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 289 [2019-10-02 16:15:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:56,169 INFO L475 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-10-02 16:15:56,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-10-02 16:15:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 16:15:56,185 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:56,186 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:56,186 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:56,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2053251468, now seen corresponding path program 1 times [2019-10-02 16:15:56,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:56,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:56,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:56,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:56,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-02 16:15:56,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:56,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:56,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:56,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:56,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:56,434 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-10-02 16:15:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:56,634 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-10-02 16:15:56,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:56,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-02 16:15:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:56,652 INFO L225 Difference]: With dead ends: 7416 [2019-10-02 16:15:56,652 INFO L226 Difference]: Without dead ends: 3914 [2019-10-02 16:15:56,659 INFO L640 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 [2019-10-02 16:15:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-10-02 16:15:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-10-02 16:15:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-10-02 16:15:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-10-02 16:15:56,752 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 300 [2019-10-02 16:15:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:56,753 INFO L475 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-10-02 16:15:56,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-10-02 16:15:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 16:15:56,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:56,764 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:56,765 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:56,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash 816481962, now seen corresponding path program 1 times [2019-10-02 16:15:56,765 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:56,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:56,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:56,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:56,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-02 16:15:56,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:56,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:56,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:56,904 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-10-02 16:15:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:57,134 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-10-02 16:15:57,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:57,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-02 16:15:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:57,168 INFO L225 Difference]: With dead ends: 8048 [2019-10-02 16:15:57,168 INFO L226 Difference]: Without dead ends: 4234 [2019-10-02 16:15:57,176 INFO L640 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 [2019-10-02 16:15:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-10-02 16:15:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-10-02 16:15:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-10-02 16:15:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-10-02 16:15:57,294 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 314 [2019-10-02 16:15:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:57,295 INFO L475 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-10-02 16:15:57,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-10-02 16:15:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-02 16:15:57,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:57,308 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:57,309 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1006853977, now seen corresponding path program 1 times [2019-10-02 16:15:57,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:57,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:57,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-02 16:15:57,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:57,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:57,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:57,525 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-10-02 16:15:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:57,612 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-10-02 16:15:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:57,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-10-02 16:15:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:57,629 INFO L225 Difference]: With dead ends: 11310 [2019-10-02 16:15:57,629 INFO L226 Difference]: Without dead ends: 7376 [2019-10-02 16:15:57,639 INFO L640 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 [2019-10-02 16:15:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-02 16:15:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-10-02 16:15:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-10-02 16:15:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-10-02 16:15:57,795 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 315 [2019-10-02 16:15:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:57,796 INFO L475 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-10-02 16:15:57,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-10-02 16:15:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-02 16:15:57,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:57,811 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:57,811 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 999089455, now seen corresponding path program 1 times [2019-10-02 16:15:57,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:57,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:57,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-02 16:15:57,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:57,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:57,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:57,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:57,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:57,985 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-10-02 16:15:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:58,203 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-10-02 16:15:58,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:58,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-10-02 16:15:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:58,222 INFO L225 Difference]: With dead ends: 14744 [2019-10-02 16:15:58,222 INFO L226 Difference]: Without dead ends: 7382 [2019-10-02 16:15:58,237 INFO L640 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 [2019-10-02 16:15:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-10-02 16:15:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-10-02 16:15:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-10-02 16:15:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-10-02 16:15:58,397 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 316 [2019-10-02 16:15:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:58,398 INFO L475 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-10-02 16:15:58,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-10-02 16:15:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-02 16:15:58,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:58,414 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:58,414 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -901585188, now seen corresponding path program 1 times [2019-10-02 16:15:58,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:58,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:58,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:58,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:58,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 766 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-02 16:15:58,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:58,539 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:15:58,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:58,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 16:15:58,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2019-10-02 16:15:58,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:15:58,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-10-02 16:15:58,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 16:15:58,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 16:15:58,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:15:58,909 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2019-10-02 16:15:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:59,795 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2019-10-02 16:15:59,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 16:15:59,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2019-10-02 16:15:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:59,819 INFO L225 Difference]: With dead ends: 18408 [2019-10-02 16:15:59,819 INFO L226 Difference]: Without dead ends: 11034 [2019-10-02 16:15:59,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-10-02 16:15:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-10-02 16:16:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-10-02 16:16:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-10-02 16:16:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-10-02 16:16:00,105 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 339 [2019-10-02 16:16:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:16:00,105 INFO L475 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-10-02 16:16:00,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 16:16:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-10-02 16:16:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-02 16:16:00,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:16:00,123 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:16:00,123 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:16:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:16:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2002133556, now seen corresponding path program 1 times [2019-10-02 16:16:00,124 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:16:00,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:16:00,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:16:00,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:16:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:16:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:16:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-02 16:16:00,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:16:00,282 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:16:00,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:16:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:16:00,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:16:00,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:16:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-10-02 16:16:00,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:16:00,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:16:00,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:16:00,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:16:00,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:16:00,574 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 5 states. [2019-10-02 16:16:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:16:01,227 INFO L93 Difference]: Finished difference Result 18174 states and 23220 transitions. [2019-10-02 16:16:01,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:16:01,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 365 [2019-10-02 16:16:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:16:01,252 INFO L225 Difference]: With dead ends: 18174 [2019-10-02 16:16:01,252 INFO L226 Difference]: Without dead ends: 9724 [2019-10-02 16:16:01,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:16:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9724 states. [2019-10-02 16:16:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9724 to 7985. [2019-10-02 16:16:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2019-10-02 16:16:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9973 transitions. [2019-10-02 16:16:01,491 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9973 transitions. Word has length 365 [2019-10-02 16:16:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:16:01,491 INFO L475 AbstractCegarLoop]: Abstraction has 7985 states and 9973 transitions. [2019-10-02 16:16:01,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:16:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9973 transitions. [2019-10-02 16:16:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-02 16:16:01,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:16:01,510 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:16:01,511 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:16:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:16:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash -885260259, now seen corresponding path program 1 times [2019-10-02 16:16:01,511 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:16:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:16:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:16:01,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:16:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:16:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:16:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-02 16:16:01,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:16:01,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:16:01,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:16:01,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:16:01,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:16:01,680 INFO L87 Difference]: Start difference. First operand 7985 states and 9973 transitions. Second operand 3 states. [2019-10-02 16:16:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:16:02,025 INFO L93 Difference]: Finished difference Result 15351 states and 18826 transitions. [2019-10-02 16:16:02,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:16:02,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-02 16:16:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:16:02,039 INFO L225 Difference]: With dead ends: 15351 [2019-10-02 16:16:02,039 INFO L226 Difference]: Without dead ends: 3759 [2019-10-02 16:16:02,076 INFO L640 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 [2019-10-02 16:16:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2019-10-02 16:16:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3524. [2019-10-02 16:16:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-10-02 16:16:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4353 transitions. [2019-10-02 16:16:02,165 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4353 transitions. Word has length 418 [2019-10-02 16:16:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:16:02,166 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 4353 transitions. [2019-10-02 16:16:02,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:16:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4353 transitions. [2019-10-02 16:16:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-10-02 16:16:02,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:16:02,267 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:16:02,267 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:16:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:16:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1596843861, now seen corresponding path program 1 times [2019-10-02 16:16:02,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:16:02,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:16:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:16:02,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:16:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:16:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:16:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-10-02 16:16:02,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:16:02,473 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:16:02,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:16:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:16:02,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:16:02,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:16:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-02 16:16:03,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:16:03,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:16:03,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:16:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:16:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:16:03,109 INFO L87 Difference]: Start difference. First operand 3524 states and 4353 transitions. Second operand 5 states. [2019-10-02 16:16:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:16:03,323 INFO L93 Difference]: Finished difference Result 4022 states and 4980 transitions. [2019-10-02 16:16:03,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:16:03,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 502 [2019-10-02 16:16:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:16:03,324 INFO L225 Difference]: With dead ends: 4022 [2019-10-02 16:16:03,325 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:16:03,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:16:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:16:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:16:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:16:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:16:03,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 502 [2019-10-02 16:16:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:16:03,330 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:16:03,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:16:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:16:03,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:16:03,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:16:04,208 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 102 [2019-10-02 16:16:05,830 WARN L191 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-10-02 16:16:05,834 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 16:16:05,835 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:16:05,835 INFO L446 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2019-10-02 16:16:05,835 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2019-10-02 16:16:05,835 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2019-10-02 16:16:05,836 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2019-10-02 16:16:05,836 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2019-10-02 16:16:05,837 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2019-10-02 16:16:05,837 INFO L439 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-02 16:16:05,837 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-10-02 16:16:05,838 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2019-10-02 16:16:05,838 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2019-10-02 16:16:05,838 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2019-10-02 16:16:05,838 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2019-10-02 16:16:05,838 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2019-10-02 16:16:05,839 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2019-10-02 16:16:05,839 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2019-10-02 16:16:05,839 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-02 16:16:05,839 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2019-10-02 16:16:05,840 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2019-10-02 16:16:05,840 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2019-10-02 16:16:05,842 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2019-10-02 16:16:05,842 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2019-10-02 16:16:05,843 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-10-02 16:16:05,845 INFO L439 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-10-02 16:16:05,846 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2019-10-02 16:16:05,846 INFO L443 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2019-10-02 16:16:05,846 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-10-02 16:16:05,846 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-02 16:16:05,846 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2019-10-02 16:16:05,847 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2019-10-02 16:16:05,847 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2019-10-02 16:16:05,847 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2019-10-02 16:16:05,847 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2019-10-02 16:16:05,847 INFO L446 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2019-10-02 16:16:05,848 INFO L439 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-02 16:16:05,848 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 16:16:05,848 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2019-10-02 16:16:05,848 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2019-10-02 16:16:05,848 INFO L446 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2019-10-02 16:16:05,850 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2019-10-02 16:16:05,850 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2019-10-02 16:16:05,850 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2019-10-02 16:16:05,850 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2019-10-02 16:16:05,851 INFO L443 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2019-10-02 16:16:05,851 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-10-02 16:16:05,851 INFO L439 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-10-02 16:16:05,851 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2019-10-02 16:16:05,852 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2019-10-02 16:16:05,853 INFO L439 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse13 (= 4464 ssl3_connect_~s__state~0)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse16 (= 4400 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= 4448 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8 .cse9) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse9) (and .cse5 .cse0 .cse1) (and .cse12 .cse6 .cse1) (and .cse3 .cse13 .cse1) (and .cse6 .cse5) (and .cse3 .cse14 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse15) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse12 .cse3) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse1 .cse2) (and .cse13 .cse0 .cse1) (and .cse3 .cse0 .cse16 .cse1) (and .cse6 .cse14) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse1 .cse17) (and .cse6 .cse16 .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse10 .cse11 .cse1 .cse15) (and .cse4 .cse0 .cse1) (and .cse0 .cse1 (= 4416 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse17)))) [2019-10-02 16:16:05,853 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2019-10-02 16:16:05,853 INFO L439 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-02 16:16:05,853 INFO L443 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2019-10-02 16:16:05,853 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2019-10-02 16:16:05,853 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2019-10-02 16:16:05,854 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2019-10-02 16:16:05,854 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2019-10-02 16:16:05,854 INFO L439 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-10-02 16:16:05,854 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2019-10-02 16:16:05,854 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2019-10-02 16:16:05,854 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-10-02 16:16:05,855 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-10-02 16:16:05,855 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2019-10-02 16:16:05,855 INFO L443 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2019-10-02 16:16:05,855 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2019-10-02 16:16:05,855 INFO L439 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-02 16:16:05,855 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2019-10-02 16:16:05,855 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2019-10-02 16:16:05,856 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2019-10-02 16:16:05,856 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2019-10-02 16:16:05,856 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2019-10-02 16:16:05,856 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2019-10-02 16:16:05,856 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-10-02 16:16:05,857 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-10-02 16:16:05,857 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-10-02 16:16:05,857 INFO L443 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2019-10-02 16:16:05,857 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2019-10-02 16:16:05,857 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2019-10-02 16:16:05,857 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2019-10-02 16:16:05,858 INFO L439 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2019-10-02 16:16:05,858 INFO L443 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2019-10-02 16:16:05,858 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-02 16:16:05,858 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2019-10-02 16:16:05,858 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2019-10-02 16:16:05,859 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2019-10-02 16:16:05,859 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2019-10-02 16:16:05,859 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2019-10-02 16:16:05,860 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2019-10-02 16:16:05,861 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-10-02 16:16:05,861 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-10-02 16:16:05,861 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-10-02 16:16:05,861 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-10-02 16:16:05,862 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2019-10-02 16:16:05,862 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2019-10-02 16:16:05,862 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2019-10-02 16:16:05,862 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2019-10-02 16:16:05,862 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2019-10-02 16:16:05,862 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2019-10-02 16:16:05,863 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-10-02 16:16:05,863 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-10-02 16:16:05,863 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2019-10-02 16:16:05,863 INFO L439 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-10-02 16:16:05,863 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2019-10-02 16:16:05,864 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2019-10-02 16:16:05,864 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2019-10-02 16:16:05,864 INFO L443 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2019-10-02 16:16:05,864 INFO L443 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2019-10-02 16:16:05,864 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2019-10-02 16:16:05,864 INFO L443 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2019-10-02 16:16:05,865 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2019-10-02 16:16:05,865 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2019-10-02 16:16:05,865 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2019-10-02 16:16:05,865 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2019-10-02 16:16:05,865 INFO L443 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2019-10-02 16:16:05,866 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-10-02 16:16:05,866 INFO L439 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)))) [2019-10-02 16:16:05,866 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2019-10-02 16:16:05,866 INFO L443 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2019-10-02 16:16:05,866 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2019-10-02 16:16:05,867 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2019-10-02 16:16:05,867 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2019-10-02 16:16:05,867 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2019-10-02 16:16:05,867 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2019-10-02 16:16:05,867 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-10-02 16:16:05,867 INFO L443 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2019-10-02 16:16:05,867 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2019-10-02 16:16:05,868 INFO L443 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2019-10-02 16:16:05,868 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:16:05,868 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 16:16:05,868 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:16:05,868 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:16:05,868 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2019-10-02 16:16:05,869 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2019-10-02 16:16:05,869 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2019-10-02 16:16:05,869 INFO L439 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-02 16:16:05,869 INFO L443 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2019-10-02 16:16:05,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:16:05 BoogieIcfgContainer [2019-10-02 16:16:05,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:16:05,931 INFO L168 Benchmark]: Toolchain (without parser) took 16823.80 ms. Allocated memory was 133.2 MB in the beginning and 935.3 MB in the end (delta: 802.2 MB). Free memory was 86.3 MB in the beginning and 290.1 MB in the end (delta: -203.8 MB). Peak memory consumption was 598.3 MB. Max. memory is 7.1 GB. [2019-10-02 16:16:05,932 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:16:05,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.23 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 86.1 MB in the beginning and 171.5 MB in the end (delta: -85.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:16:05,934 INFO L168 Benchmark]: Boogie Preprocessor took 78.97 ms. Allocated memory is still 200.3 MB. Free memory was 171.5 MB in the beginning and 169.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-02 16:16:05,936 INFO L168 Benchmark]: RCFGBuilder took 785.13 ms. Allocated memory is still 200.3 MB. Free memory was 169.0 MB in the beginning and 121.9 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:16:05,938 INFO L168 Benchmark]: TraceAbstraction took 15472.25 ms. Allocated memory was 200.3 MB in the beginning and 935.3 MB in the end (delta: 735.1 MB). Free memory was 121.3 MB in the beginning and 290.1 MB in the end (delta: -168.8 MB). Peak memory consumption was 566.3 MB. Max. memory is 7.1 GB. [2019-10-02 16:16:05,944 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 482.23 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 86.1 MB in the beginning and 171.5 MB in the end (delta: -85.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.97 ms. Allocated memory is still 200.3 MB. Free memory was 171.5 MB in the beginning and 169.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.13 ms. Allocated memory is still 200.3 MB. Free memory was 169.0 MB in the beginning and 121.9 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15472.25 ms. Allocated memory was 200.3 MB in the beginning and 935.3 MB in the end (delta: 735.1 MB). Free memory was 121.3 MB in the beginning and 290.1 MB in the end (delta: -168.8 MB). Peak memory consumption was 566.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: 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: 162]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. SAFE Result, 15.3s OverallTime, 24 OverallIterations, 19 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 4900 SDtfs, 1943 SDslu, 3317 SDs, 0 SdLazy, 2728 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 1254 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=21, 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.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 5148 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 240 NumberOfFragments, 700 HoareAnnotationTreeSize, 26 FomulaSimplifications, 16669 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1623 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 6457 NumberOfCodeBlocks, 6457 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6430 ConstructedInterpolants, 0 QuantifiedInterpolants, 3029160 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2267 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 23929/23960 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...