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_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:14,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:14,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:14,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:14,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:14,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:14,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:14,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:14,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:14,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:14,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:14,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:14,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:14,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:14,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:14,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:14,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:14,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:14,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:14,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:14,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:14,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:14,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:14,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:14,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:14,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:14,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:14,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:14,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:14,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:14,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:14,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:14,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:14,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:14,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:14,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:14,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:14,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:14,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:14,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:14,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:14,557 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-14 23:49:14,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:14,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:14,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:14,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:14,572 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:14,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:14,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:14,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:14,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:14,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:14,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:14,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:14,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:14,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:14,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:14,574 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:14,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:14,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:14,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:14,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:14,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:14,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:14,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:14,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:14,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:14,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:14,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:14,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:14,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:14,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:14,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:14,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:14,906 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:14,906 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:14,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-14 23:49:14,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cd33c3c/87a72d5aefc74c62ba32f79f839c1612/FLAG1a455f35f [2019-10-14 23:49:15,484 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:15,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-10-14 23:49:15,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cd33c3c/87a72d5aefc74c62ba32f79f839c1612/FLAG1a455f35f [2019-10-14 23:49:15,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cd33c3c/87a72d5aefc74c62ba32f79f839c1612 [2019-10-14 23:49:15,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:15,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:15,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:15,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:15,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:15,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:15" (1/1) ... [2019-10-14 23:49:15,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433b84b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:15, skipping insertion in model container [2019-10-14 23:49:15,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:15" (1/1) ... [2019-10-14 23:49:15,890 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:15,928 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:16,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:16,195 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:16,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:16,373 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:16,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16 WrapperNode [2019-10-14 23:49:16,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:16,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:16,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:16,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:16,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (1/1) ... [2019-10-14 23:49:16,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (1/1) ... [2019-10-14 23:49:16,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (1/1) ... [2019-10-14 23:49:16,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (1/1) ... [2019-10-14 23:49:16,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (1/1) ... [2019-10-14 23:49:16,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (1/1) ... [2019-10-14 23:49:16,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (1/1) ... [2019-10-14 23:49:16,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:16,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:16,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:16,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:16,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (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-14 23:49:16,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:16,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:16,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-14 23:49:16,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:16,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-14 23:49:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:16,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:16,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:16,674 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:17,210 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-14 23:49:17,210 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-14 23:49:17,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:17,220 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:17,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:17 BoogieIcfgContainer [2019-10-14 23:49:17,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:17,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:17,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:17,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:17,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:15" (1/3) ... [2019-10-14 23:49:17,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776b17e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:17, skipping insertion in model container [2019-10-14 23:49:17,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:16" (2/3) ... [2019-10-14 23:49:17,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776b17e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:17, skipping insertion in model container [2019-10-14 23:49:17,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:17" (3/3) ... [2019-10-14 23:49:17,230 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-10-14 23:49:17,240 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:17,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:17,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:17,285 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:17,285 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:17,285 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:17,286 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:17,286 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:17,286 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:17,286 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:17,286 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-10-14 23:49:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:49:17,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:17,317 INFO L380 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-14 23:49:17,318 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-10-14 23:49:17,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:17,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009362871] [2019-10-14 23:49:17,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,570 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-14 23:49:17,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009362871] [2019-10-14 23:49:17,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:17,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:17,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616281251] [2019-10-14 23:49:17,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:17,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:17,596 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-10-14 23:49:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:17,710 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-10-14 23:49:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:17,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:49:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:17,727 INFO L225 Difference]: With dead ends: 377 [2019-10-14 23:49:17,727 INFO L226 Difference]: Without dead ends: 220 [2019-10-14 23:49:17,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-14 23:49:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-14 23:49:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-14 23:49:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-10-14 23:49:17,821 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-10-14 23:49:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:17,822 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-10-14 23:49:17,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-10-14 23:49:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 23:49:17,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:17,825 INFO L380 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-14 23:49:17,826 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:17,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2019-10-14 23:49:17,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:17,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966845913] [2019-10-14 23:49:17,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:17,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:17,960 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-14 23:49:17,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966845913] [2019-10-14 23:49:17,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:17,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:17,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938514514] [2019-10-14 23:49:17,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:17,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:17,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:17,964 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-10-14 23:49:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:18,164 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-10-14 23:49:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:18,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-14 23:49:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:18,168 INFO L225 Difference]: With dead ends: 470 [2019-10-14 23:49:18,168 INFO L226 Difference]: Without dead ends: 262 [2019-10-14 23:49:18,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-14 23:49:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-10-14 23:49:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-14 23:49:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-10-14 23:49:18,199 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-10-14 23:49:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:18,200 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-10-14 23:49:18,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-10-14 23:49:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:49:18,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:18,206 INFO L380 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-14 23:49:18,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:18,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2019-10-14 23:49:18,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:18,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010391283] [2019-10-14 23:49:18,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,309 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-14 23:49:18,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010391283] [2019-10-14 23:49:18,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:18,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:18,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705960062] [2019-10-14 23:49:18,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:18,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:18,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:18,317 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-10-14 23:49:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:18,522 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-10-14 23:49:18,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:18,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-14 23:49:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:18,526 INFO L225 Difference]: With dead ends: 598 [2019-10-14 23:49:18,526 INFO L226 Difference]: Without dead ends: 354 [2019-10-14 23:49:18,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-14 23:49:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-10-14 23:49:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-14 23:49:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-10-14 23:49:18,562 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-10-14 23:49:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:18,562 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-10-14 23:49:18,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-10-14 23:49:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:49:18,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:18,565 INFO L380 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-14 23:49:18,565 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2019-10-14 23:49:18,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:18,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901705924] [2019-10-14 23:49:18,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,649 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-14 23:49:18,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901705924] [2019-10-14 23:49:18,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:18,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:18,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236677214] [2019-10-14 23:49:18,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:18,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:18,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:18,651 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-10-14 23:49:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:18,801 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-10-14 23:49:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:18,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-14 23:49:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:18,807 INFO L225 Difference]: With dead ends: 708 [2019-10-14 23:49:18,808 INFO L226 Difference]: Without dead ends: 384 [2019-10-14 23:49:18,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-14 23:49:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-10-14 23:49:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-14 23:49:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-10-14 23:49:18,834 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-10-14 23:49:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:18,835 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-10-14 23:49:18,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-10-14 23:49:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-14 23:49:18,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:18,841 INFO L380 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-14 23:49:18,841 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2019-10-14 23:49:18,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:18,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629578434] [2019-10-14 23:49:18,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:18,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:18,936 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-14 23:49:18,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629578434] [2019-10-14 23:49:18,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:18,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:18,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998401133] [2019-10-14 23:49:18,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:18,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:18,940 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-10-14 23:49:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,133 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-10-14 23:49:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-14 23:49:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,137 INFO L225 Difference]: With dead ends: 842 [2019-10-14 23:49:19,137 INFO L226 Difference]: Without dead ends: 478 [2019-10-14 23:49:19,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-14 23:49:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-10-14 23:49:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-14 23:49:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-10-14 23:49:19,154 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-10-14 23:49:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,154 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-10-14 23:49:19,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-10-14 23:49:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:49:19,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,157 INFO L380 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-14 23:49:19,157 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2019-10-14 23:49:19,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61700718] [2019-10-14 23:49:19,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,210 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-14 23:49:19,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61700718] [2019-10-14 23:49:19,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:19,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:19,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367941640] [2019-10-14 23:49:19,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:19,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:19,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:19,213 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-10-14 23:49:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,347 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-10-14 23:49:19,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-14 23:49:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,357 INFO L225 Difference]: With dead ends: 940 [2019-10-14 23:49:19,357 INFO L226 Difference]: Without dead ends: 500 [2019-10-14 23:49:19,359 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-14 23:49:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-10-14 23:49:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-14 23:49:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-10-14 23:49:19,381 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-10-14 23:49:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,382 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-10-14 23:49:19,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-10-14 23:49:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-14 23:49:19,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,384 INFO L380 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-14 23:49:19,384 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2019-10-14 23:49:19,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075665114] [2019-10-14 23:49:19,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,444 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-14 23:49:19,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075665114] [2019-10-14 23:49:19,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:19,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:19,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945002840] [2019-10-14 23:49:19,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:19,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:19,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:19,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:19,447 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-10-14 23:49:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,487 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-10-14 23:49:19,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-14 23:49:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,493 INFO L225 Difference]: With dead ends: 976 [2019-10-14 23:49:19,493 INFO L226 Difference]: Without dead ends: 734 [2019-10-14 23:49:19,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-14 23:49:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-10-14 23:49:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-10-14 23:49:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-10-14 23:49:19,519 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-10-14 23:49:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,519 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-10-14 23:49:19,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-10-14 23:49:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-14 23:49:19,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,522 INFO L380 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-14 23:49:19,522 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,523 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2019-10-14 23:49:19,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540335172] [2019-10-14 23:49:19,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,586 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-14 23:49:19,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540335172] [2019-10-14 23:49:19,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:19,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:19,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836879103] [2019-10-14 23:49:19,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:19,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:19,588 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-10-14 23:49:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,644 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-10-14 23:49:19,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-14 23:49:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,650 INFO L225 Difference]: With dead ends: 976 [2019-10-14 23:49:19,650 INFO L226 Difference]: Without dead ends: 974 [2019-10-14 23:49:19,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-14 23:49:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-10-14 23:49:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-14 23:49:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-10-14 23:49:19,677 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-10-14 23:49:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,678 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-10-14 23:49:19,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-10-14 23:49:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-14 23:49:19,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,681 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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] [2019-10-14 23:49:19,682 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2019-10-14 23:49:19,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687165355] [2019-10-14 23:49:19,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-14 23:49:19,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687165355] [2019-10-14 23:49:19,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:19,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:19,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973420753] [2019-10-14 23:49:19,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:19,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:19,743 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-10-14 23:49:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:19,896 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-10-14 23:49:19,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:19,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-14 23:49:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:19,903 INFO L225 Difference]: With dead ends: 2140 [2019-10-14 23:49:19,903 INFO L226 Difference]: Without dead ends: 1170 [2019-10-14 23:49:19,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-10-14 23:49:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-10-14 23:49:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-14 23:49:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-10-14 23:49:19,939 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2019-10-14 23:49:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:19,939 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-10-14 23:49:19,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-10-14 23:49:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-14 23:49:19,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:19,944 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2019-10-14 23:49:19,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2019-10-14 23:49:19,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:19,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214659868] [2019-10-14 23:49:19,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:19,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-14 23:49:20,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214659868] [2019-10-14 23:49:20,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:20,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:20,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726591167] [2019-10-14 23:49:20,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:20,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:20,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:20,063 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-10-14 23:49:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:20,197 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-10-14 23:49:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:20,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-14 23:49:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:20,205 INFO L225 Difference]: With dead ends: 2354 [2019-10-14 23:49:20,205 INFO L226 Difference]: Without dead ends: 1236 [2019-10-14 23:49:20,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-14 23:49:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-10-14 23:49:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-14 23:49:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-10-14 23:49:20,246 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2019-10-14 23:49:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:20,247 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-10-14 23:49:20,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-10-14 23:49:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-14 23:49:20,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:20,252 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:49:20,252 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2019-10-14 23:49:20,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:20,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365245501] [2019-10-14 23:49:20,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-10-14 23:49:20,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365245501] [2019-10-14 23:49:20,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:20,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:20,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971642665] [2019-10-14 23:49:20,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:20,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:20,341 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-10-14 23:49:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:20,489 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-10-14 23:49:20,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:20,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-14 23:49:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:20,499 INFO L225 Difference]: With dead ends: 2544 [2019-10-14 23:49:20,500 INFO L226 Difference]: Without dead ends: 1334 [2019-10-14 23:49:20,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-10-14 23:49:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-10-14 23:49:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-14 23:49:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-10-14 23:49:20,553 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2019-10-14 23:49:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:20,553 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-10-14 23:49:20,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-10-14 23:49:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-14 23:49:20,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:20,580 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-10-14 23:49:20,580 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2019-10-14 23:49:20,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:20,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613993286] [2019-10-14 23:49:20,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-14 23:49:20,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613993286] [2019-10-14 23:49:20,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:20,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:20,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282951604] [2019-10-14 23:49:20,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:20,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:20,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:20,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:20,691 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-10-14 23:49:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:20,823 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-10-14 23:49:20,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:20,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-14 23:49:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:20,830 INFO L225 Difference]: With dead ends: 2752 [2019-10-14 23:49:20,830 INFO L226 Difference]: Without dead ends: 1442 [2019-10-14 23:49:20,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-10-14 23:49:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-10-14 23:49:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-14 23:49:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-10-14 23:49:20,869 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2019-10-14 23:49:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:20,869 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-10-14 23:49:20,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-10-14 23:49:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-14 23:49:20,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:20,875 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-10-14 23:49:20,875 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2019-10-14 23:49:20,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:20,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182209609] [2019-10-14 23:49:20,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:20,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-14 23:49:21,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182209609] [2019-10-14 23:49:21,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:21,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:21,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117270201] [2019-10-14 23:49:21,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:21,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:21,013 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-10-14 23:49:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:21,159 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-10-14 23:49:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:21,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-14 23:49:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:21,167 INFO L225 Difference]: With dead ends: 2992 [2019-10-14 23:49:21,167 INFO L226 Difference]: Without dead ends: 1570 [2019-10-14 23:49:21,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-14 23:49:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-10-14 23:49:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-14 23:49:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-10-14 23:49:21,210 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2019-10-14 23:49:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:21,210 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-10-14 23:49:21,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-10-14 23:49:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-14 23:49:21,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:21,218 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 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] [2019-10-14 23:49:21,218 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2019-10-14 23:49:21,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:21,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444872118] [2019-10-14 23:49:21,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-10-14 23:49:21,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444872118] [2019-10-14 23:49:21,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:21,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:21,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504973518] [2019-10-14 23:49:21,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:21,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:21,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:21,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:21,319 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-10-14 23:49:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:21,367 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-10-14 23:49:21,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:21,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-14 23:49:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:21,382 INFO L225 Difference]: With dead ends: 4646 [2019-10-14 23:49:21,382 INFO L226 Difference]: Without dead ends: 3100 [2019-10-14 23:49:21,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-10-14 23:49:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-10-14 23:49:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-10-14 23:49:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-10-14 23:49:21,477 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2019-10-14 23:49:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:21,478 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-10-14 23:49:21,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-10-14 23:49:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-14 23:49:21,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:21,523 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 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] [2019-10-14 23:49:21,523 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2019-10-14 23:49:21,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:21,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098937538] [2019-10-14 23:49:21,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:21,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-10-14 23:49:21,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098937538] [2019-10-14 23:49:21,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:21,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:21,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868963741] [2019-10-14 23:49:21,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:21,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:21,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:21,688 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-10-14 23:49:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:21,917 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-10-14 23:49:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:21,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-14 23:49:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:21,939 INFO L225 Difference]: With dead ends: 6484 [2019-10-14 23:49:21,939 INFO L226 Difference]: Without dead ends: 3398 [2019-10-14 23:49:21,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-14 23:49:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-10-14 23:49:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-10-14 23:49:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-10-14 23:49:22,060 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2019-10-14 23:49:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:22,061 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-10-14 23:49:22,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-10-14 23:49:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-14 23:49:22,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:22,079 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 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, 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-14 23:49:22,080 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:22,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2019-10-14 23:49:22,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:22,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481103247] [2019-10-14 23:49:22,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-10-14 23:49:22,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481103247] [2019-10-14 23:49:22,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:22,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:22,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096767330] [2019-10-14 23:49:22,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:22,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:22,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:22,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:22,253 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-10-14 23:49:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:22,414 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-10-14 23:49:22,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:22,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-14 23:49:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:22,430 INFO L225 Difference]: With dead ends: 6900 [2019-10-14 23:49:22,430 INFO L226 Difference]: Without dead ends: 3530 [2019-10-14 23:49:22,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-10-14 23:49:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-10-14 23:49:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-10-14 23:49:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-10-14 23:49:22,524 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2019-10-14 23:49:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:22,525 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-10-14 23:49:22,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-10-14 23:49:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-14 23:49:22,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:22,541 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 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, 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] [2019-10-14 23:49:22,541 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2019-10-14 23:49:22,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:22,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289536035] [2019-10-14 23:49:22,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-14 23:49:22,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289536035] [2019-10-14 23:49:22,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:22,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:22,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239632029] [2019-10-14 23:49:22,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:22,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:22,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:22,663 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-10-14 23:49:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:22,892 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-10-14 23:49:22,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:22,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-14 23:49:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:22,911 INFO L225 Difference]: With dead ends: 7416 [2019-10-14 23:49:22,911 INFO L226 Difference]: Without dead ends: 3914 [2019-10-14 23:49:22,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-10-14 23:49:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-10-14 23:49:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-10-14 23:49:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-10-14 23:49:23,040 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2019-10-14 23:49:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,041 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-10-14 23:49:23,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-10-14 23:49:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-14 23:49:23,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,062 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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] [2019-10-14 23:49:23,062 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:23,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:23,063 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2019-10-14 23:49:23,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:23,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546542262] [2019-10-14 23:49:23,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-10-14 23:49:23,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546542262] [2019-10-14 23:49:23,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:23,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:23,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753033792] [2019-10-14 23:49:23,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:23,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:23,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,245 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-10-14 23:49:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:23,533 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-10-14 23:49:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:23,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-14 23:49:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:23,580 INFO L225 Difference]: With dead ends: 8048 [2019-10-14 23:49:23,581 INFO L226 Difference]: Without dead ends: 4234 [2019-10-14 23:49:23,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-10-14 23:49:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-10-14 23:49:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-10-14 23:49:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-10-14 23:49:23,746 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2019-10-14 23:49:23,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,747 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-10-14 23:49:23,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-10-14 23:49:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-14 23:49:23,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,768 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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-14 23:49:23,768 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2019-10-14 23:49:23,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:23,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738395360] [2019-10-14 23:49:23,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-14 23:49:24,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738395360] [2019-10-14 23:49:24,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658568111] [2019-10-14 23:49:24,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,074 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-10-14 23:49:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,211 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-10-14 23:49:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-10-14 23:49:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,239 INFO L225 Difference]: With dead ends: 11310 [2019-10-14 23:49:24,239 INFO L226 Difference]: Without dead ends: 7376 [2019-10-14 23:49:24,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-14 23:49:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-10-14 23:49:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-10-14 23:49:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-10-14 23:49:24,499 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2019-10-14 23:49:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:24,500 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-10-14 23:49:24,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-10-14 23:49:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-10-14 23:49:24,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:24,525 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 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, 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] [2019-10-14 23:49:24,526 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:24,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:24,526 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2019-10-14 23:49:24,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:24,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675910991] [2019-10-14 23:49:24,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-10-14 23:49:24,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675910991] [2019-10-14 23:49:24,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597348601] [2019-10-14 23:49:24,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,776 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-10-14 23:49:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:25,089 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-10-14 23:49:25,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:25,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-10-14 23:49:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:25,104 INFO L225 Difference]: With dead ends: 14744 [2019-10-14 23:49:25,104 INFO L226 Difference]: Without dead ends: 7382 [2019-10-14 23:49:25,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-10-14 23:49:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-10-14 23:49:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-10-14 23:49:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-10-14 23:49:25,284 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2019-10-14 23:49:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:25,284 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-10-14 23:49:25,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-10-14 23:49:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-14 23:49:25,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:25,300 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:49:25,300 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2019-10-14 23:49:25,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:25,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348958587] [2019-10-14 23:49:25,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-14 23:49:25,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348958587] [2019-10-14 23:49:25,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7445068] [2019-10-14 23:49:25,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:49:25,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-10-14 23:49:25,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:25,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-10-14 23:49:25,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366396970] [2019-10-14 23:49:25,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:25,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:25,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:49:25,848 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2019-10-14 23:49:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:26,156 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2019-10-14 23:49:26,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:26,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 353 [2019-10-14 23:49:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:26,171 INFO L225 Difference]: With dead ends: 14866 [2019-10-14 23:49:26,171 INFO L226 Difference]: Without dead ends: 7500 [2019-10-14 23:49:26,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:49:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2019-10-14 23:49:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2019-10-14 23:49:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-10-14 23:49:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-10-14 23:49:26,399 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 353 [2019-10-14 23:49:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:26,399 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-10-14 23:49:26,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-10-14 23:49:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-14 23:49:26,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:26,418 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:49:26,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:26,622 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1456365214, now seen corresponding path program 1 times [2019-10-14 23:49:26,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:26,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448046242] [2019-10-14 23:49:26,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-14 23:49:26,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448046242] [2019-10-14 23:49:26,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456959296] [2019-10-14 23:49:26,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:26,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-14 23:49:27,189 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:27,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:27,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208914449] [2019-10-14 23:49:27,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:27,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:27,192 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2019-10-14 23:49:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:27,819 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2019-10-14 23:49:27,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:27,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 366 [2019-10-14 23:49:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:27,855 INFO L225 Difference]: With dead ends: 14624 [2019-10-14 23:49:27,855 INFO L226 Difference]: Without dead ends: 11034 [2019-10-14 23:49:27,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-10-14 23:49:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-10-14 23:49:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-10-14 23:49:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-10-14 23:49:28,231 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 366 [2019-10-14 23:49:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:28,232 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-10-14 23:49:28,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-10-14 23:49:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-14 23:49:28,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:28,261 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 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, 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-14 23:49:28,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:28,475 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 2 times [2019-10-14 23:49:28,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:28,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067732180] [2019-10-14 23:49:28,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:28,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:28,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:28,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067732180] [2019-10-14 23:49:28,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607433761] [2019-10-14 23:49:28,888 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:29,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:49:29,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:49:29,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:29,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:29,135 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:29,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:29,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062961999] [2019-10-14 23:49:29,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:29,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:29,139 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2019-10-14 23:49:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:29,538 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2019-10-14 23:49:29,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:29,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-10-14 23:49:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:29,561 INFO L225 Difference]: With dead ends: 19118 [2019-10-14 23:49:29,561 INFO L226 Difference]: Without dead ends: 10668 [2019-10-14 23:49:29,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2019-10-14 23:49:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2019-10-14 23:49:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-10-14 23:49:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2019-10-14 23:49:29,793 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2019-10-14 23:49:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:29,794 INFO L462 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2019-10-14 23:49:29,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2019-10-14 23:49:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-14 23:49:29,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:29,814 INFO L380 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-14 23:49:30,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:30,019 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:30,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2019-10-14 23:49:30,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:30,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299463908] [2019-10-14 23:49:30,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,265 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-14 23:49:30,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299463908] [2019-10-14 23:49:30,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:30,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:30,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592996301] [2019-10-14 23:49:30,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:30,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:30,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:30,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:30,268 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2019-10-14 23:49:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:30,479 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2019-10-14 23:49:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:30,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-14 23:49:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:30,487 INFO L225 Difference]: With dead ends: 15876 [2019-10-14 23:49:30,487 INFO L226 Difference]: Without dead ends: 3820 [2019-10-14 23:49:30,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2019-10-14 23:49:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2019-10-14 23:49:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2019-10-14 23:49:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2019-10-14 23:49:30,571 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2019-10-14 23:49:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:30,571 INFO L462 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2019-10-14 23:49:30,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2019-10-14 23:49:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-10-14 23:49:30,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:30,586 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 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, 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-14 23:49:30,586 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2019-10-14 23:49:30,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:30,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35685673] [2019-10-14 23:49:30,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-10-14 23:49:30,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35685673] [2019-10-14 23:49:30,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002311503] [2019-10-14 23:49:30,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:30,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-10-14 23:49:31,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:31,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:31,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972115075] [2019-10-14 23:49:31,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:31,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:31,454 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 3 states. [2019-10-14 23:49:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:31,515 INFO L93 Difference]: Finished difference Result 4045 states and 5016 transitions. [2019-10-14 23:49:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:31,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 516 [2019-10-14 23:49:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:31,528 INFO L225 Difference]: With dead ends: 4045 [2019-10-14 23:49:31,528 INFO L226 Difference]: Without dead ends: 3968 [2019-10-14 23:49:31,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-10-14 23:49:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3535. [2019-10-14 23:49:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2019-10-14 23:49:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4415 transitions. [2019-10-14 23:49:31,627 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 4415 transitions. Word has length 516 [2019-10-14 23:49:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:31,628 INFO L462 AbstractCegarLoop]: Abstraction has 3535 states and 4415 transitions. [2019-10-14 23:49:31,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 4415 transitions. [2019-10-14 23:49:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-10-14 23:49:31,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:31,664 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-14 23:49:31,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:31,880 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1541123714, now seen corresponding path program 1 times [2019-10-14 23:49:31,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:31,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744247744] [2019-10-14 23:49:31,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:31,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:31,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-14 23:49:32,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744247744] [2019-10-14 23:49:32,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76023524] [2019-10-14 23:49:32,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:32,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-10-14 23:49:32,807 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:32,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:32,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700219605] [2019-10-14 23:49:32,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:32,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:32,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:32,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:32,811 INFO L87 Difference]: Start difference. First operand 3535 states and 4415 transitions. Second operand 4 states. [2019-10-14 23:49:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:33,157 INFO L93 Difference]: Finished difference Result 4397 states and 5486 transitions. [2019-10-14 23:49:33,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:33,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 628 [2019-10-14 23:49:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:33,160 INFO L225 Difference]: With dead ends: 4397 [2019-10-14 23:49:33,160 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:49:33,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:49:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:49:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:49:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:49:33,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 628 [2019-10-14 23:49:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:33,169 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:49:33,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:49:33,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:49:33,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:33,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:49:33,552 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2019-10-14 23:49:33,841 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 37 [2019-10-14 23:49:34,909 WARN L191 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 451 DAG size of output: 100 [2019-10-14 23:49:35,318 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-10-14 23:49:35,793 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2019-10-14 23:49:35,941 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-10-14 23:49:36,623 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-10-14 23:49:36,706 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:49:36,707 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:49:36,707 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-10-14 23:49:36,707 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-10-14 23:49:36,707 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-10-14 23:49:36,707 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-10-14 23:49:36,707 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-10-14 23:49:36,708 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-10-14 23:49:36,708 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-14 23:49:36,708 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) 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-14 23:49:36,708 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-14 23:49:36,708 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-14 23:49:36,709 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-10-14 23:49:36,709 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-10-14 23:49:36,709 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-10-14 23:49:36,709 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-14 23:49:36,710 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-10-14 23:49:36,710 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:36,710 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-10-14 23:49:36,711 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-10-14 23:49:36,712 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-10-14 23:49:36,712 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2019-10-14 23:49:36,712 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-10-14 23:49:36,712 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-10-14 23:49:36,714 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:36,714 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-14 23:49:36,714 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-10-14 23:49:36,714 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-14 23:49:36,714 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-10-14 23:49:36,714 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-10-14 23:49:36,715 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-10-14 23:49:36,715 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-14 23:49:36,715 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-10-14 23:49:36,715 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-10-14 23:49:36,715 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-10-14 23:49:36,715 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-10-14 23:49:36,715 INFO L443 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2019-10-14 23:49:36,716 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-10-14 23:49:36,716 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-10-14 23:49:36,716 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-10-14 23:49:36,717 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-14 23:49:36,717 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-10-14 23:49:36,717 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-10-14 23:49:36,717 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-10-14 23:49:36,717 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-10-14 23:49:36,718 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-10-14 23:49:36,718 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-10-14 23:49:36,718 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-10-14 23:49:36,718 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-10-14 23:49:36,718 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-10-14 23:49:36,718 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-10-14 23:49:36,718 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-10-14 23:49:36,718 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) 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-14 23:49:36,719 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-10-14 23:49:36,719 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-10-14 23:49:36,719 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-10-14 23:49:36,719 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-10-14 23:49:36,719 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-10-14 23:49:36,719 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-10-14 23:49:36,719 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-10-14 23:49:36,719 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-14 23:49:36,720 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-10-14 23:49:36,720 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-10-14 23:49:36,721 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-10-14 23:49:36,721 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-10-14 23:49:36,721 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-10-14 23:49:36,721 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2019-10-14 23:49:36,722 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-10-14 23:49:36,722 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-10-14 23:49:36,722 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-10-14 23:49:36,722 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-10-14 23:49:36,722 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) 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-14 23:49:36,722 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-14 23:49:36,722 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-10-14 23:49:36,723 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-10-14 23:49:36,723 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2019-10-14 23:49:36,723 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-10-14 23:49:36,723 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2019-10-14 23:49:36,723 INFO L443 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:36,724 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) 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 .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) (<= ssl3_connect_~blastFlag~0 0)))) [2019-10-14 23:49:36,724 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-10-14 23:49:36,724 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-10-14 23:49:36,724 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-10-14 23:49:36,724 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-10-14 23:49:36,724 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-10-14 23:49:36,724 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-14 23:49:36,725 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:36,725 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-10-14 23:49:36,725 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:36,726 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-10-14 23:49:36,726 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-10-14 23:49:36,726 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-10-14 23:49:36,727 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-14 23:49:36,728 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-10-14 23:49:36,728 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-10-14 23:49:36,728 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-10-14 23:49:36,728 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) 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_~blastFlag~0 0) .cse0) (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-14 23:49:36,728 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) 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-14 23:49:36,728 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-10-14 23:49:36,728 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-10-14 23:49:36,729 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-10-14 23:49:36,729 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-10-14 23:49:36,729 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-10-14 23:49:36,729 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-10-14 23:49:36,729 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-10-14 23:49:36,729 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-10-14 23:49:36,729 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) 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 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-10-14 23:49:36,730 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= 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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-10-14 23:49:36,730 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-10-14 23:49:36,730 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-10-14 23:49:36,730 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-10-14 23:49:36,730 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-10-14 23:49:36,730 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-10-14 23:49:36,730 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-10-14 23:49:36,730 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-10-14 23:49:36,731 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-10-14 23:49:36,731 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= 4352 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 (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2019-10-14 23:49:36,731 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-14 23:49:36,731 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-10-14 23:49:36,731 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:49:36,731 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:49:36,732 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:49:36,732 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:49:36,732 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-14 23:49:36,732 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-10-14 23:49:36,732 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-10-14 23:49:36,732 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-10-14 23:49:36,732 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-10-14 23:49:36,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:49:36 BoogieIcfgContainer [2019-10-14 23:49:36,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:49:36,785 INFO L168 Benchmark]: Toolchain (without parser) took 20909.72 ms. Allocated memory was 143.7 MB in the beginning and 1.0 GB in the end (delta: 888.7 MB). Free memory was 100.7 MB in the beginning and 426.3 MB in the end (delta: -325.6 MB). Peak memory consumption was 563.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:36,786 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:49:36,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.27 ms. Allocated memory was 143.7 MB in the beginning and 200.3 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 175.7 MB in the end (delta: -75.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:36,789 INFO L168 Benchmark]: Boogie Preprocessor took 50.47 ms. Allocated memory is still 200.3 MB. Free memory was 175.7 MB in the beginning and 172.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:36,789 INFO L168 Benchmark]: RCFGBuilder took 797.45 ms. Allocated memory is still 200.3 MB. Free memory was 172.9 MB in the beginning and 126.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:36,790 INFO L168 Benchmark]: TraceAbstraction took 19557.20 ms. Allocated memory was 200.3 MB in the beginning and 1.0 GB in the end (delta: 832.0 MB). Free memory was 126.3 MB in the beginning and 426.3 MB in the end (delta: -300.0 MB). Peak memory consumption was 532.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:36,795 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.46 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 500.27 ms. Allocated memory was 143.7 MB in the beginning and 200.3 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 175.7 MB in the end (delta: -75.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.47 ms. Allocated memory is still 200.3 MB. Free memory was 175.7 MB in the beginning and 172.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.45 ms. Allocated memory is still 200.3 MB. Free memory was 172.9 MB in the beginning and 126.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19557.20 ms. Allocated memory was 200.3 MB in the beginning and 1.0 GB in the end (delta: 832.0 MB). Free memory was 126.3 MB in the beginning and 426.3 MB in the end (delta: -300.0 MB). Peak memory consumption was 532.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 189]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (blastFlag <= 0 && 4560 <= s__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: 147]: 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 177]: 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: 135]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 171]: 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: 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 <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 153]: 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: 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)) || (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)) || blastFlag <= 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: 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: 129]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((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: 165]: 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 19.4s, OverallIterations: 26, TraceHistogramMax: 22, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, HoareTripleCheckerStatistics: 5408 SDtfs, 1932 SDslu, 3225 SDs, 0 SdLazy, 2605 SolverSat, 477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2379 GetRequests, 2340 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8518occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 6109 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 264 NumberOfFragments, 773 HoareAnnotationTreeSize, 26 FomulaSimplifications, 20317 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2059 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 8697 NumberOfCodeBlocks, 8697 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8666 ConstructedInterpolants, 0 QuantifiedInterpolants, 4528166 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4056 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 31 InterpolantComputations, 23 PerfectInterpolantSequences, 37661/37743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...