/usr/bin/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_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:22:01,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:22:01,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:22:01,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:22:01,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:22:01,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:22:01,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:22:01,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:22:01,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:22:01,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:22:01,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:22:01,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:22:01,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:22:01,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:22:01,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:22:01,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:22:01,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:22:01,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:22:01,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:22:01,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:22:01,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:22:01,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:22:01,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:22:01,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:22:01,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:22:01,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:22:01,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:22:01,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:22:01,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:22:01,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:22:01,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:22:01,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:22:01,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:22:01,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:22:01,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:22:01,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:22:01,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:22:01,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:22:01,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:22:01,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:22:01,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:22:01,670 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-11-06 22:22:01,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:22:01,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:22:01,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:22:01,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:22:01,686 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:22:01,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:22:01,687 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:22:01,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:22:01,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:22:01,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:22:01,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:22:01,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:22:01,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:22:01,688 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:22:01,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:22:01,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:22:01,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:22:01,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:22:01,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:22:01,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:22:01,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:22:01,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:22:01,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:22:01,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:22:01,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:22:01,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:22:01,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:22:01,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:22:01,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:22:01,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:22:01,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:22:02,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:22:02,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:22:02,004 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:22:02,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-06 22:22:02,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7fc3272/cabba989519a459fbe448fb1ea498435/FLAGc84b6d668 [2019-11-06 22:22:02,605 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:22:02,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-06 22:22:02,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7fc3272/cabba989519a459fbe448fb1ea498435/FLAGc84b6d668 [2019-11-06 22:22:02,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7fc3272/cabba989519a459fbe448fb1ea498435 [2019-11-06 22:22:02,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:22:02,940 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:22:02,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:02,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:22:02,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:22:02,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:02" (1/1) ... [2019-11-06 22:22:02,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653e4e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:02, skipping insertion in model container [2019-11-06 22:22:02,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:02" (1/1) ... [2019-11-06 22:22:02,958 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:22:03,014 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:22:03,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:03,326 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:22:03,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:03,544 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:22:03,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03 WrapperNode [2019-11-06 22:22:03,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:03,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:22:03,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:22:03,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:22:03,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (1/1) ... [2019-11-06 22:22:03,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (1/1) ... [2019-11-06 22:22:03,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (1/1) ... [2019-11-06 22:22:03,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (1/1) ... [2019-11-06 22:22:03,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (1/1) ... [2019-11-06 22:22:03,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (1/1) ... [2019-11-06 22:22:03,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (1/1) ... [2019-11-06 22:22:03,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:22:03,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:22:03,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:22:03,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:22:03,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (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-11-06 22:22:03,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:22:03,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:22:03,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-11-06 22:22:03,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:22:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:22:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:22:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:22:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 22:22:03,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 22:22:03,684 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-11-06 22:22:03,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:22:03,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:22:03,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:22:03,825 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 22:22:04,435 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-06 22:22:04,435 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-06 22:22:04,448 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:22:04,449 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:22:04,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:04 BoogieIcfgContainer [2019-11-06 22:22:04,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:22:04,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:22:04,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:22:04,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:22:04,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:02" (1/3) ... [2019-11-06 22:22:04,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fce7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:04, skipping insertion in model container [2019-11-06 22:22:04,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:03" (2/3) ... [2019-11-06 22:22:04,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fce7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:04, skipping insertion in model container [2019-11-06 22:22:04,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:04" (3/3) ... [2019-11-06 22:22:04,459 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-11-06 22:22:04,470 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:22:04,479 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:22:04,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:22:04,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:22:04,524 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:22:04,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:22:04,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:22:04,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:22:04,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:22:04,526 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:22:04,526 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:22:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-11-06 22:22:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 22:22:04,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:04,568 INFO L410 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-11-06 22:22:04,570 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2019-11-06 22:22:04,586 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:04,587 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969724384] [2019-11-06 22:22:04,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:04,802 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969724384] [2019-11-06 22:22:04,803 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:04,803 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:04,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110727638] [2019-11-06 22:22:04,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:04,811 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:04,828 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2019-11-06 22:22:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:04,948 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2019-11-06 22:22:04,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:04,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 22:22:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:04,975 INFO L225 Difference]: With dead ends: 374 [2019-11-06 22:22:04,975 INFO L226 Difference]: Without dead ends: 218 [2019-11-06 22:22:04,983 INFO L630 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-11-06 22:22:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-06 22:22:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-11-06 22:22:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-06 22:22:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2019-11-06 22:22:05,051 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2019-11-06 22:22:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:05,051 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2019-11-06 22:22:05,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2019-11-06 22:22:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 22:22:05,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:05,055 INFO L410 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-11-06 22:22:05,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2019-11-06 22:22:05,056 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:05,057 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903115347] [2019-11-06 22:22:05,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:05,157 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903115347] [2019-11-06 22:22:05,158 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:05,158 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:05,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140802203] [2019-11-06 22:22:05,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:05,160 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:05,161 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2019-11-06 22:22:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:05,382 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2019-11-06 22:22:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:05,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-06 22:22:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:05,386 INFO L225 Difference]: With dead ends: 466 [2019-11-06 22:22:05,386 INFO L226 Difference]: Without dead ends: 260 [2019-11-06 22:22:05,389 INFO L630 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-11-06 22:22:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-06 22:22:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-11-06 22:22:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-06 22:22:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2019-11-06 22:22:05,409 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2019-11-06 22:22:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:05,409 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2019-11-06 22:22:05,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2019-11-06 22:22:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:22:05,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:05,413 INFO L410 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-11-06 22:22:05,413 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:05,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2019-11-06 22:22:05,414 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:05,414 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720869558] [2019-11-06 22:22:05,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 22:22:05,529 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720869558] [2019-11-06 22:22:05,529 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:05,530 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:05,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799423783] [2019-11-06 22:22:05,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:05,533 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:05,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:05,533 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2019-11-06 22:22:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:05,746 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2019-11-06 22:22:05,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:05,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:22:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:05,750 INFO L225 Difference]: With dead ends: 594 [2019-11-06 22:22:05,750 INFO L226 Difference]: Without dead ends: 352 [2019-11-06 22:22:05,752 INFO L630 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-11-06 22:22:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-06 22:22:05,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-11-06 22:22:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-06 22:22:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2019-11-06 22:22:05,786 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2019-11-06 22:22:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:05,786 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2019-11-06 22:22:05,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2019-11-06 22:22:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:22:05,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:05,791 INFO L410 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-11-06 22:22:05,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2019-11-06 22:22:05,792 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:05,792 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187937119] [2019-11-06 22:22:05,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 22:22:05,874 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187937119] [2019-11-06 22:22:05,874 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:05,875 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:05,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750514113] [2019-11-06 22:22:05,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:05,876 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:05,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:05,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:05,877 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2019-11-06 22:22:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:06,036 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2019-11-06 22:22:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:06,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:22:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:06,040 INFO L225 Difference]: With dead ends: 702 [2019-11-06 22:22:06,040 INFO L226 Difference]: Without dead ends: 380 [2019-11-06 22:22:06,042 INFO L630 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-11-06 22:22:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-06 22:22:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2019-11-06 22:22:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:22:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2019-11-06 22:22:06,060 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2019-11-06 22:22:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:06,060 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2019-11-06 22:22:06,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2019-11-06 22:22:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-06 22:22:06,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:06,065 INFO L410 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-11-06 22:22:06,065 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:06,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2019-11-06 22:22:06,066 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:06,066 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010070354] [2019-11-06 22:22:06,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 22:22:06,152 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010070354] [2019-11-06 22:22:06,152 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:06,152 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:06,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137227983] [2019-11-06 22:22:06,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:06,155 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:06,156 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2019-11-06 22:22:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:06,360 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2019-11-06 22:22:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:06,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-06 22:22:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:06,364 INFO L225 Difference]: With dead ends: 838 [2019-11-06 22:22:06,364 INFO L226 Difference]: Without dead ends: 476 [2019-11-06 22:22:06,365 INFO L630 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-11-06 22:22:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-11-06 22:22:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2019-11-06 22:22:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-11-06 22:22:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2019-11-06 22:22:06,382 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2019-11-06 22:22:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:06,382 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2019-11-06 22:22:06,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2019-11-06 22:22:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-06 22:22:06,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:06,384 INFO L410 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] [2019-11-06 22:22:06,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:06,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2019-11-06 22:22:06,385 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:06,386 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228245376] [2019-11-06 22:22:06,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-06 22:22:06,472 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228245376] [2019-11-06 22:22:06,473 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:06,473 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:06,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357713066] [2019-11-06 22:22:06,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:06,475 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:06,476 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2019-11-06 22:22:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:06,614 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2019-11-06 22:22:06,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:06,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-06 22:22:06,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:06,618 INFO L225 Difference]: With dead ends: 936 [2019-11-06 22:22:06,618 INFO L226 Difference]: Without dead ends: 498 [2019-11-06 22:22:06,620 INFO L630 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-11-06 22:22:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-06 22:22:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2019-11-06 22:22:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-11-06 22:22:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2019-11-06 22:22:06,636 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2019-11-06 22:22:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:06,637 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2019-11-06 22:22:06,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2019-11-06 22:22:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-06 22:22:06,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:06,639 INFO L410 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] [2019-11-06 22:22:06,639 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2019-11-06 22:22:06,640 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:06,640 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334313305] [2019-11-06 22:22:06,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:22:06,716 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334313305] [2019-11-06 22:22:06,716 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:06,717 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:06,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863617964] [2019-11-06 22:22:06,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:06,719 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:06,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:06,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:06,720 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2019-11-06 22:22:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:06,763 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2019-11-06 22:22:06,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:06,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-06 22:22:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:06,768 INFO L225 Difference]: With dead ends: 972 [2019-11-06 22:22:06,768 INFO L226 Difference]: Without dead ends: 731 [2019-11-06 22:22:06,769 INFO L630 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-11-06 22:22:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-11-06 22:22:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-11-06 22:22:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-06 22:22:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2019-11-06 22:22:06,793 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2019-11-06 22:22:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:06,794 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2019-11-06 22:22:06,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2019-11-06 22:22:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-06 22:22:06,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:06,802 INFO L410 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] [2019-11-06 22:22:06,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:06,803 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2019-11-06 22:22:06,803 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:06,803 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746944103] [2019-11-06 22:22:06,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-06 22:22:06,911 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746944103] [2019-11-06 22:22:06,912 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:06,912 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:06,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361595222] [2019-11-06 22:22:06,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:06,913 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:06,913 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2019-11-06 22:22:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:06,959 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2019-11-06 22:22:06,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:06,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-06 22:22:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:06,966 INFO L225 Difference]: With dead ends: 972 [2019-11-06 22:22:06,966 INFO L226 Difference]: Without dead ends: 970 [2019-11-06 22:22:06,967 INFO L630 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-11-06 22:22:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-11-06 22:22:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-11-06 22:22:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-11-06 22:22:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2019-11-06 22:22:06,995 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2019-11-06 22:22:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:06,995 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2019-11-06 22:22:06,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2019-11-06 22:22:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-06 22:22:06,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:06,999 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2019-11-06 22:22:06,999 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2019-11-06 22:22:07,000 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:07,000 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695473597] [2019-11-06 22:22:07,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-06 22:22:07,063 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695473597] [2019-11-06 22:22:07,065 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:07,065 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:07,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440477691] [2019-11-06 22:22:07,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:07,066 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:07,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:07,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:07,067 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2019-11-06 22:22:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:07,205 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2019-11-06 22:22:07,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:07,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-06 22:22:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:07,211 INFO L225 Difference]: With dead ends: 2034 [2019-11-06 22:22:07,211 INFO L226 Difference]: Without dead ends: 1076 [2019-11-06 22:22:07,213 INFO L630 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-11-06 22:22:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-11-06 22:22:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2019-11-06 22:22:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-11-06 22:22:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2019-11-06 22:22:07,243 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2019-11-06 22:22:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:07,244 INFO L462 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2019-11-06 22:22:07,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2019-11-06 22:22:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-06 22:22:07,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:07,248 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1] [2019-11-06 22:22:07,248 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:07,248 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2019-11-06 22:22:07,249 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:07,249 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117901572] [2019-11-06 22:22:07,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-06 22:22:07,330 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117901572] [2019-11-06 22:22:07,331 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:07,331 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:07,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691059920] [2019-11-06 22:22:07,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:07,342 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:07,343 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2019-11-06 22:22:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:07,538 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2019-11-06 22:22:07,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:07,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-06 22:22:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:07,547 INFO L225 Difference]: With dead ends: 2316 [2019-11-06 22:22:07,547 INFO L226 Difference]: Without dead ends: 1258 [2019-11-06 22:22:07,556 INFO L630 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-11-06 22:22:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-11-06 22:22:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2019-11-06 22:22:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-11-06 22:22:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2019-11-06 22:22:07,597 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2019-11-06 22:22:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:07,597 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2019-11-06 22:22:07,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2019-11-06 22:22:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-06 22:22:07,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:07,602 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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-11-06 22:22:07,602 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2019-11-06 22:22:07,603 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:07,603 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377369158] [2019-11-06 22:22:07,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-06 22:22:07,697 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377369158] [2019-11-06 22:22:07,698 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:07,698 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:07,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975547986] [2019-11-06 22:22:07,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:07,699 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:07,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:07,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:07,699 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2019-11-06 22:22:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:07,852 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2019-11-06 22:22:07,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:07,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-06 22:22:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:07,859 INFO L225 Difference]: With dead ends: 2544 [2019-11-06 22:22:07,860 INFO L226 Difference]: Without dead ends: 1338 [2019-11-06 22:22:07,863 INFO L630 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-11-06 22:22:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-11-06 22:22:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2019-11-06 22:22:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-11-06 22:22:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2019-11-06 22:22:07,905 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2019-11-06 22:22:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:07,906 INFO L462 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2019-11-06 22:22:07,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2019-11-06 22:22:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-06 22:22:07,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:07,915 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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-11-06 22:22:07,915 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2019-11-06 22:22:07,916 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:07,917 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081266660] [2019-11-06 22:22:07,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-06 22:22:08,051 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081266660] [2019-11-06 22:22:08,051 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:08,051 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:08,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844031995] [2019-11-06 22:22:08,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:08,052 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:08,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:08,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:08,052 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2019-11-06 22:22:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:08,206 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2019-11-06 22:22:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:08,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-06 22:22:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:08,214 INFO L225 Difference]: With dead ends: 2784 [2019-11-06 22:22:08,214 INFO L226 Difference]: Without dead ends: 1466 [2019-11-06 22:22:08,217 INFO L630 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-11-06 22:22:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-11-06 22:22:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2019-11-06 22:22:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-11-06 22:22:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2019-11-06 22:22:08,256 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2019-11-06 22:22:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:08,257 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2019-11-06 22:22:08,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2019-11-06 22:22:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-06 22:22:08,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:08,264 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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-11-06 22:22:08,265 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2019-11-06 22:22:08,266 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:08,266 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327225981] [2019-11-06 22:22:08,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-11-06 22:22:08,350 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327225981] [2019-11-06 22:22:08,350 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:08,350 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:08,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266444286] [2019-11-06 22:22:08,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:08,351 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:08,352 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2019-11-06 22:22:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:08,414 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2019-11-06 22:22:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:08,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-11-06 22:22:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:08,430 INFO L225 Difference]: With dead ends: 4334 [2019-11-06 22:22:08,430 INFO L226 Difference]: Without dead ends: 2892 [2019-11-06 22:22:08,434 INFO L630 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-11-06 22:22:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-11-06 22:22:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2019-11-06 22:22:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-11-06 22:22:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2019-11-06 22:22:08,538 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2019-11-06 22:22:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:08,539 INFO L462 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2019-11-06 22:22:08,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2019-11-06 22:22:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-06 22:22:08,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:08,550 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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-11-06 22:22:08,550 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:08,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:08,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2019-11-06 22:22:08,551 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:08,551 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460706080] [2019-11-06 22:22:08,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-11-06 22:22:08,647 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460706080] [2019-11-06 22:22:08,647 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:08,648 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:08,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10022461] [2019-11-06 22:22:08,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:08,649 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:08,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:08,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:08,650 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2019-11-06 22:22:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:08,844 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2019-11-06 22:22:08,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:08,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-11-06 22:22:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:08,861 INFO L225 Difference]: With dead ends: 6068 [2019-11-06 22:22:08,862 INFO L226 Difference]: Without dead ends: 3190 [2019-11-06 22:22:08,867 INFO L630 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-11-06 22:22:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2019-11-06 22:22:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2019-11-06 22:22:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-11-06 22:22:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2019-11-06 22:22:08,956 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2019-11-06 22:22:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:08,957 INFO L462 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2019-11-06 22:22:08,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2019-11-06 22:22:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-06 22:22:08,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:08,964 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 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-11-06 22:22:08,965 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:08,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2019-11-06 22:22:08,965 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:08,965 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976094312] [2019-11-06 22:22:08,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-11-06 22:22:09,089 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976094312] [2019-11-06 22:22:09,089 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:09,089 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:09,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626277332] [2019-11-06 22:22:09,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:09,090 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:09,091 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2019-11-06 22:22:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:09,262 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2019-11-06 22:22:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:09,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-11-06 22:22:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:09,278 INFO L225 Difference]: With dead ends: 6484 [2019-11-06 22:22:09,279 INFO L226 Difference]: Without dead ends: 3322 [2019-11-06 22:22:09,285 INFO L630 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-11-06 22:22:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2019-11-06 22:22:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2019-11-06 22:22:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-11-06 22:22:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2019-11-06 22:22:09,380 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2019-11-06 22:22:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:09,381 INFO L462 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2019-11-06 22:22:09,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2019-11-06 22:22:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-06 22:22:09,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:09,390 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:09,390 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2019-11-06 22:22:09,390 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:09,391 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758722813] [2019-11-06 22:22:09,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-11-06 22:22:09,485 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758722813] [2019-11-06 22:22:09,485 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:09,485 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:09,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635604864] [2019-11-06 22:22:09,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:09,486 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:09,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:09,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:09,487 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2019-11-06 22:22:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:09,697 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2019-11-06 22:22:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:09,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-06 22:22:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:09,716 INFO L225 Difference]: With dead ends: 7000 [2019-11-06 22:22:09,716 INFO L226 Difference]: Without dead ends: 3706 [2019-11-06 22:22:09,723 INFO L630 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-11-06 22:22:09,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-11-06 22:22:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2019-11-06 22:22:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-11-06 22:22:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2019-11-06 22:22:09,808 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2019-11-06 22:22:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:09,809 INFO L462 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2019-11-06 22:22:09,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2019-11-06 22:22:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-06 22:22:09,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:09,824 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2019-11-06 22:22:09,824 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2019-11-06 22:22:09,825 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:09,825 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412477533] [2019-11-06 22:22:09,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-11-06 22:22:09,940 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412477533] [2019-11-06 22:22:09,940 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:09,940 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:09,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080759448] [2019-11-06 22:22:09,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:09,941 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:09,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:09,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:09,942 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2019-11-06 22:22:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:10,154 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2019-11-06 22:22:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:10,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-06 22:22:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:10,184 INFO L225 Difference]: With dead ends: 7632 [2019-11-06 22:22:10,184 INFO L226 Difference]: Without dead ends: 4026 [2019-11-06 22:22:10,191 INFO L630 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-11-06 22:22:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-11-06 22:22:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2019-11-06 22:22:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-11-06 22:22:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2019-11-06 22:22:10,289 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2019-11-06 22:22:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:10,289 INFO L462 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2019-11-06 22:22:10,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2019-11-06 22:22:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-06 22:22:10,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:10,301 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-11-06 22:22:10,301 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2019-11-06 22:22:10,302 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:10,302 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635538485] [2019-11-06 22:22:10,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-11-06 22:22:10,548 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635538485] [2019-11-06 22:22:10,549 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:10,549 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:10,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181239535] [2019-11-06 22:22:10,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:10,550 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:10,551 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2019-11-06 22:22:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:10,682 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2019-11-06 22:22:10,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:10,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-06 22:22:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:10,701 INFO L225 Difference]: With dead ends: 10686 [2019-11-06 22:22:10,702 INFO L226 Difference]: Without dead ends: 6960 [2019-11-06 22:22:10,712 INFO L630 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-11-06 22:22:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2019-11-06 22:22:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2019-11-06 22:22:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2019-11-06 22:22:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2019-11-06 22:22:10,926 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2019-11-06 22:22:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:10,926 INFO L462 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2019-11-06 22:22:10,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2019-11-06 22:22:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-06 22:22:10,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:10,945 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:10,945 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2019-11-06 22:22:10,946 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:10,947 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845450756] [2019-11-06 22:22:10,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-11-06 22:22:11,128 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845450756] [2019-11-06 22:22:11,128 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:11,129 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:11,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625804640] [2019-11-06 22:22:11,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:11,130 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:11,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:11,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:11,130 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2019-11-06 22:22:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:11,374 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2019-11-06 22:22:11,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:11,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-11-06 22:22:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:11,392 INFO L225 Difference]: With dead ends: 13912 [2019-11-06 22:22:11,392 INFO L226 Difference]: Without dead ends: 6966 [2019-11-06 22:22:11,406 INFO L630 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-11-06 22:22:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-11-06 22:22:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2019-11-06 22:22:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-11-06 22:22:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2019-11-06 22:22:11,556 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2019-11-06 22:22:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:11,557 INFO L462 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2019-11-06 22:22:11,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2019-11-06 22:22:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-06 22:22:11,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:11,573 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:11,573 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2019-11-06 22:22:11,574 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:11,574 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004929361] [2019-11-06 22:22:11,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-11-06 22:22:11,695 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004929361] [2019-11-06 22:22:11,695 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545103848] [2019-11-06 22:22:11,695 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-11-06 22:22:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:11,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:22:11,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-11-06 22:22:12,095 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:12,095 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-11-06 22:22:12,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076365512] [2019-11-06 22:22:12,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:12,096 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:12,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:12,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:22:12,097 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 4 states. [2019-11-06 22:22:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:12,384 INFO L93 Difference]: Finished difference Result 14034 states and 18379 transitions. [2019-11-06 22:22:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:12,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-11-06 22:22:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:12,402 INFO L225 Difference]: With dead ends: 14034 [2019-11-06 22:22:12,402 INFO L226 Difference]: Without dead ends: 7084 [2019-11-06 22:22:12,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:22:12,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2019-11-06 22:22:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 6940. [2019-11-06 22:22:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6940 states. [2019-11-06 22:22:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6940 states to 6940 states and 9085 transitions. [2019-11-06 22:22:12,603 INFO L78 Accepts]: Start accepts. Automaton has 6940 states and 9085 transitions. Word has length 284 [2019-11-06 22:22:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:12,603 INFO L462 AbstractCegarLoop]: Abstraction has 6940 states and 9085 transitions. [2019-11-06 22:22:12,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6940 states and 9085 transitions. [2019-11-06 22:22:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-06 22:22:12,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:12,620 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:12,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:12,827 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:12,827 INFO L82 PathProgramCache]: Analyzing trace with hash -39333344, now seen corresponding path program 1 times [2019-11-06 22:22:12,827 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:12,828 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066676925] [2019-11-06 22:22:12,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-06 22:22:13,022 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066676925] [2019-11-06 22:22:13,022 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402230949] [2019-11-06 22:22:13,023 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-11-06 22:22:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:13,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:13,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-06 22:22:13,296 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:13,296 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:13,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020616676] [2019-11-06 22:22:13,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:13,298 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:13,298 INFO L87 Difference]: Start difference. First operand 6940 states and 9085 transitions. Second operand 4 states. [2019-11-06 22:22:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:13,810 INFO L93 Difference]: Finished difference Result 13792 states and 18051 transitions. [2019-11-06 22:22:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:13,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-11-06 22:22:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:13,832 INFO L225 Difference]: With dead ends: 13792 [2019-11-06 22:22:13,832 INFO L226 Difference]: Without dead ends: 10410 [2019-11-06 22:22:13,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 301 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-11-06 22:22:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2019-11-06 22:22:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 8844. [2019-11-06 22:22:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2019-11-06 22:22:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11583 transitions. [2019-11-06 22:22:14,091 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11583 transitions. Word has length 297 [2019-11-06 22:22:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:14,092 INFO L462 AbstractCegarLoop]: Abstraction has 8844 states and 11583 transitions. [2019-11-06 22:22:14,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11583 transitions. [2019-11-06 22:22:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-06 22:22:14,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:14,112 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:14,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:14,325 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:14,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:14,326 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 2 times [2019-11-06 22:22:14,326 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:14,326 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360698481] [2019-11-06 22:22:14,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-06 22:22:14,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360698481] [2019-11-06 22:22:14,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124006981] [2019-11-06 22:22:14,523 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-11-06 22:22:14,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 22:22:14,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 22:22:14,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:14,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-11-06 22:22:14,704 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:14,704 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:22:14,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335504099] [2019-11-06 22:22:14,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:14,706 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:14,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:14,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:14,706 INFO L87 Difference]: Start difference. First operand 8844 states and 11583 transitions. Second operand 3 states. [2019-11-06 22:22:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:14,912 INFO L93 Difference]: Finished difference Result 18102 states and 23742 transitions. [2019-11-06 22:22:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:14,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-06 22:22:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:14,931 INFO L225 Difference]: With dead ends: 18102 [2019-11-06 22:22:14,932 INFO L226 Difference]: Without dead ends: 9276 [2019-11-06 22:22:14,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2019-11-06 22:22:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9204. [2019-11-06 22:22:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9204 states. [2019-11-06 22:22:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9204 states to 9204 states and 12063 transitions. [2019-11-06 22:22:15,133 INFO L78 Accepts]: Start accepts. Automaton has 9204 states and 12063 transitions. Word has length 310 [2019-11-06 22:22:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:15,134 INFO L462 AbstractCegarLoop]: Abstraction has 9204 states and 12063 transitions. [2019-11-06 22:22:15,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 9204 states and 12063 transitions. [2019-11-06 22:22:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-11-06 22:22:15,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:15,153 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:15,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:15,357 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash 670685447, now seen corresponding path program 1 times [2019-11-06 22:22:15,358 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:15,358 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049445691] [2019-11-06 22:22:15,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-06 22:22:15,584 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049445691] [2019-11-06 22:22:15,585 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52908433] [2019-11-06 22:22:15,585 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-11-06 22:22:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:15,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:15,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-11-06 22:22:15,833 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:15,833 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:22:15,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495992581] [2019-11-06 22:22:15,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:15,835 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:15,835 INFO L87 Difference]: Start difference. First operand 9204 states and 12063 transitions. Second operand 3 states. [2019-11-06 22:22:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:16,010 INFO L93 Difference]: Finished difference Result 22958 states and 30072 transitions. [2019-11-06 22:22:16,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:16,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-11-06 22:22:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:16,044 INFO L225 Difference]: With dead ends: 22958 [2019-11-06 22:22:16,044 INFO L226 Difference]: Without dead ends: 13772 [2019-11-06 22:22:16,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 379 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-11-06 22:22:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13772 states. [2019-11-06 22:22:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13772 to 13772. [2019-11-06 22:22:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13772 states. [2019-11-06 22:22:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13772 states to 13772 states and 18009 transitions. [2019-11-06 22:22:16,365 INFO L78 Accepts]: Start accepts. Automaton has 13772 states and 18009 transitions. Word has length 377 [2019-11-06 22:22:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:16,366 INFO L462 AbstractCegarLoop]: Abstraction has 13772 states and 18009 transitions. [2019-11-06 22:22:16,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 13772 states and 18009 transitions. [2019-11-06 22:22:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-06 22:22:16,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:16,395 INFO L410 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:16,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:16,599 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2068327023, now seen corresponding path program 1 times [2019-11-06 22:22:16,600 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:16,600 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999986576] [2019-11-06 22:22:16,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-06 22:22:16,838 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999986576] [2019-11-06 22:22:16,838 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186257699] [2019-11-06 22:22:16,838 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-11-06 22:22:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:16,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:16,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-06 22:22:17,058 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:17,058 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:17,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096372959] [2019-11-06 22:22:17,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:17,061 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:17,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:17,062 INFO L87 Difference]: Start difference. First operand 13772 states and 18009 transitions. Second operand 4 states. [2019-11-06 22:22:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:17,574 INFO L93 Difference]: Finished difference Result 30950 states and 40277 transitions. [2019-11-06 22:22:17,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:17,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-06 22:22:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:17,609 INFO L225 Difference]: With dead ends: 30950 [2019-11-06 22:22:17,609 INFO L226 Difference]: Without dead ends: 17184 [2019-11-06 22:22:17,627 INFO L630 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-11-06 22:22:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17184 states. [2019-11-06 22:22:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17184 to 14520. [2019-11-06 22:22:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14520 states. [2019-11-06 22:22:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14520 states to 14520 states and 18571 transitions. [2019-11-06 22:22:17,960 INFO L78 Accepts]: Start accepts. Automaton has 14520 states and 18571 transitions. Word has length 379 [2019-11-06 22:22:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:17,961 INFO L462 AbstractCegarLoop]: Abstraction has 14520 states and 18571 transitions. [2019-11-06 22:22:17,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 14520 states and 18571 transitions. [2019-11-06 22:22:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-11-06 22:22:17,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:17,991 INFO L410 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, 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-11-06 22:22:18,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:18,203 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash -725462501, now seen corresponding path program 1 times [2019-11-06 22:22:18,204 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:18,204 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911324283] [2019-11-06 22:22:18,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-06 22:22:18,344 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911324283] [2019-11-06 22:22:18,344 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:18,344 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:18,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620469103] [2019-11-06 22:22:18,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:18,345 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:18,347 INFO L87 Difference]: Start difference. First operand 14520 states and 18571 transitions. Second operand 3 states. [2019-11-06 22:22:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:18,593 INFO L93 Difference]: Finished difference Result 27597 states and 34926 transitions. [2019-11-06 22:22:18,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:18,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-11-06 22:22:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:18,604 INFO L225 Difference]: With dead ends: 27597 [2019-11-06 22:22:18,604 INFO L226 Difference]: Without dead ends: 5535 [2019-11-06 22:22:18,621 INFO L630 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-11-06 22:22:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-11-06 22:22:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5194. [2019-11-06 22:22:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2019-11-06 22:22:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 6445 transitions. [2019-11-06 22:22:18,715 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 6445 transitions. Word has length 418 [2019-11-06 22:22:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:18,716 INFO L462 AbstractCegarLoop]: Abstraction has 5194 states and 6445 transitions. [2019-11-06 22:22:18,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 6445 transitions. [2019-11-06 22:22:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-11-06 22:22:18,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:18,729 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:18,729 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2019-11-06 22:22:18,731 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:18,731 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556536342] [2019-11-06 22:22:18,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-06 22:22:18,978 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556536342] [2019-11-06 22:22:18,978 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419246138] [2019-11-06 22:22:18,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:19,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:19,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-06 22:22:19,225 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:19,226 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:19,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333219313] [2019-11-06 22:22:19,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:19,227 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:19,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:19,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:19,228 INFO L87 Difference]: Start difference. First operand 5194 states and 6445 transitions. Second operand 4 states. [2019-11-06 22:22:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:19,395 INFO L93 Difference]: Finished difference Result 5690 states and 7070 transitions. [2019-11-06 22:22:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:19,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-11-06 22:22:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:19,396 INFO L225 Difference]: With dead ends: 5690 [2019-11-06 22:22:19,396 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:22:19,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 451 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-11-06 22:22:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:22:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:22:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:22:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:22:19,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2019-11-06 22:22:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:19,404 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:22:19,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:22:19,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:22:19,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:19,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:22:19,894 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2019-11-06 22:22:20,868 WARN L191 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 93 [2019-11-06 22:22:21,423 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 19 [2019-11-06 22:22:22,253 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-11-06 22:22:22,580 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-06 22:22:22,580 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:22:22,581 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-06 22:22:22,581 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-11-06 22:22:22,581 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2019-11-06 22:22:22,581 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2019-11-06 22:22:22,581 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2019-11-06 22:22:22,581 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2019-11-06 22:22:22,581 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-11-06 22:22:22,581 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-11-06 22:22:22,582 INFO L439 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-06 22:22:22,582 INFO L446 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2019-11-06 22:22:22,582 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-11-06 22:22:22,582 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2019-11-06 22:22:22,582 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2019-11-06 22:22:22,582 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2019-11-06 22:22:22,583 INFO L439 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (<= ssl3_connect_~blastFlag~0 0) (and (<= ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ssl3_connect_~blastFlag~0 4) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2019-11-06 22:22:22,583 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2019-11-06 22:22:22,583 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2019-11-06 22:22:22,583 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2019-11-06 22:22:22,583 INFO L439 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2019-11-06 22:22:22,583 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-06 22:22:22,583 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2019-11-06 22:22:22,583 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2019-11-06 22:22:22,584 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2019-11-06 22:22:22,584 INFO L443 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2019-11-06 22:22:22,584 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2019-11-06 22:22:22,584 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2019-11-06 22:22:22,584 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2019-11-06 22:22:22,584 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2019-11-06 22:22:22,584 INFO L443 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2019-11-06 22:22:22,584 INFO L439 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-06 22:22:22,585 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2019-11-06 22:22:22,585 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2019-11-06 22:22:22,585 INFO L443 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2019-11-06 22:22:22,585 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2019-11-06 22:22:22,585 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2019-11-06 22:22:22,585 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2019-11-06 22:22:22,585 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2019-11-06 22:22:22,585 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2019-11-06 22:22:22,586 INFO L439 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_connect_~s__hit~0 0) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2019-11-06 22:22:22,586 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-11-06 22:22:22,586 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-11-06 22:22:22,586 INFO L443 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2019-11-06 22:22:22,586 INFO L439 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-11-06 22:22:22,586 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2019-11-06 22:22:22,586 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2019-11-06 22:22:22,587 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2019-11-06 22:22:22,587 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-06 22:22:22,587 INFO L439 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-06 22:22:22,587 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-06 22:22:22,590 INFO L439 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 3)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4528)) (.cse6 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse4 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse5 (= ssl3_connect_~s__state~0 4512))) (or (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (and .cse0 .cse4) (and .cse5 .cse4 .cse6) (and .cse3 .cse7 .cse4 .cse8 .cse6 .cse9) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse0 .cse7 .cse8) (and .cse3 .cse10 .cse11 .cse4 .cse6 .cse9) (and .cse4 .cse6 (= ssl3_connect_~s__state~0 4480)) (and .cse0 (= 4384 ssl3_connect_~s__state~0)) (and (= ssl3_connect_~s__state~0 4496) .cse4 .cse6) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11) (and (= 4464 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse2 .cse3 .cse6) (and (<= ssl3_connect_~blastFlag~0 4) .cse4 .cse6) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse6 .cse4) (and .cse0 .cse5))) [2019-11-06 22:22:22,590 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-11-06 22:22:22,590 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2019-11-06 22:22:22,590 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2019-11-06 22:22:22,590 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2019-11-06 22:22:22,590 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-11-06 22:22:22,590 INFO L443 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2019-11-06 22:22:22,591 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-11-06 22:22:22,591 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2019-11-06 22:22:22,591 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2019-11-06 22:22:22,591 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2019-11-06 22:22:22,591 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2019-11-06 22:22:22,591 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2019-11-06 22:22:22,591 INFO L439 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_connect_~s__hit~0 0) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1))) [2019-11-06 22:22:22,591 INFO L439 ceAbstractionStarter]: At program point L119(lines 115 509) 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 .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2019-11-06 22:22:22,591 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-11-06 22:22:22,591 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2019-11-06 22:22:22,592 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-11-06 22:22:22,593 INFO L439 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse3) (and .cse4 .cse0 .cse2))) [2019-11-06 22:22:22,593 INFO L439 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2019-11-06 22:22:22,593 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2019-11-06 22:22:22,594 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-11-06 22:22:22,595 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-06 22:22:22,595 INFO L439 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3 .cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4) .cse3 .cse4))) [2019-11-06 22:22:22,595 INFO L439 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2019-11-06 22:22:22,595 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-11-06 22:22:22,595 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2019-11-06 22:22:22,595 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2019-11-06 22:22:22,595 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2019-11-06 22:22:22,596 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2019-11-06 22:22:22,596 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-11-06 22:22:22,596 INFO L443 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2019-11-06 22:22:22,596 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2019-11-06 22:22:22,596 INFO L443 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2019-11-06 22:22:22,596 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2019-11-06 22:22:22,596 INFO L439 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-06 22:22:22,596 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-06 22:22:22,597 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-06 22:22:22,597 INFO L443 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2019-11-06 22:22:22,597 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-11-06 22:22:22,597 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-11-06 22:22:22,597 INFO L443 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2019-11-06 22:22:22,597 INFO L443 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2019-11-06 22:22:22,597 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2019-11-06 22:22:22,597 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2019-11-06 22:22:22,597 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2019-11-06 22:22:22,598 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2019-11-06 22:22:22,598 INFO L439 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2019-11-06 22:22:22,598 INFO L439 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (<= 12292 ssl3_connect_~s__state~0)) (.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_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2019-11-06 22:22:22,598 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:22:22,598 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 22:22:22,598 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:22:22,598 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:22:22,599 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2019-11-06 22:22:22,599 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2019-11-06 22:22:22,599 INFO L446 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2019-11-06 22:22:22,599 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2019-11-06 22:22:22,599 INFO L443 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2019-11-06 22:22:22,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:22:22 BoogieIcfgContainer [2019-11-06 22:22:22,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:22:22,650 INFO L168 Benchmark]: Toolchain (without parser) took 19710.10 ms. Allocated memory was 145.8 MB in the beginning and 972.6 MB in the end (delta: 826.8 MB). Free memory was 102.9 MB in the beginning and 557.3 MB in the end (delta: -454.4 MB). Peak memory consumption was 716.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:22,651 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 22:22:22,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.16 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 178.6 MB in the end (delta: -76.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:22,652 INFO L168 Benchmark]: Boogie Preprocessor took 57.22 ms. Allocated memory is still 203.4 MB. Free memory was 178.6 MB in the beginning and 176.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:22,652 INFO L168 Benchmark]: RCFGBuilder took 847.79 ms. Allocated memory is still 203.4 MB. Free memory was 176.3 MB in the beginning and 130.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:22,653 INFO L168 Benchmark]: TraceAbstraction took 18193.61 ms. Allocated memory was 203.4 MB in the beginning and 972.6 MB in the end (delta: 769.1 MB). Free memory was 129.4 MB in the beginning and 557.3 MB in the end (delta: -427.9 MB). Peak memory consumption was 685.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:22,660 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.21 ms. Allocated memory is still 145.8 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 604.16 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 178.6 MB in the end (delta: -76.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.22 ms. Allocated memory is still 203.4 MB. Free memory was 178.6 MB in the beginning and 176.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.79 ms. Allocated memory is still 203.4 MB. Free memory was 176.3 MB in the beginning and 130.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18193.61 ms. Allocated memory was 203.4 MB in the beginning and 972.6 MB in the end (delta: 769.1 MB). Free memory was 129.4 MB in the beginning and 557.3 MB in the end (delta: -427.9 MB). Peak memory consumption was 685.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: 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: 151]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && s__state == 4528) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state == 4512 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state == 4480)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__state == 4496 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || ((4464 == s__state && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || !(12292 <= \old(initial_state))) || ((s__state == 4528 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((blastFlag <= 0 || (blastFlag <= 2 && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state)) || ((blastFlag <= 2 && 12292 <= s__state) && s__hit == 0)) || (((12292 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0)) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 135 locations, 1 error locations. Result: SAFE, OverallTime: 18.0s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, HoareTripleCheckerStatistics: 5320 SDtfs, 1895 SDslu, 2986 SDs, 0 SdLazy, 2527 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2231 GetRequests, 2191 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14520occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 5371 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 505 NumberOfFragments, 750 HoareAnnotationTreeSize, 26 FomulaSimplifications, 40117 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 4509 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 7447 NumberOfCodeBlocks, 7447 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7415 ConstructedInterpolants, 0 QuantifiedInterpolants, 2973961 SizeOfPredicates, 10 NumberOfNonLiveVariables, 4035 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 24196/24298 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...