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_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:19,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:19,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:19,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:19,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:19,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:19,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:19,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:19,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:19,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:19,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:19,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:19,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:19,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:19,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:19,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:19,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:19,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:19,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:19,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:19,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:19,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:19,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:19,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:19,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:19,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:19,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:19,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:19,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:19,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:19,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:19,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:19,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:19,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:19,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:19,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:19,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:19,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:19,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:19,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:19,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:19,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:49:19,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:19,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:19,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:19,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:19,985 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:19,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:19,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:19,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:19,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:19,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:19,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:19,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:19,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:19,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:19,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:19,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:19,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:19,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:19,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:19,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:19,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:19,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:19,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:19,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:19,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:19,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:19,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:19,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:19,990 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:20,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:20,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:20,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:20,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:20,255 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:20,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-10-14 23:49:20,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8c899b8/1f2c5c06cab84a4e834bcb9d3b89cb4e/FLAG9dc373ceb [2019-10-14 23:49:20,825 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:20,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-1.c [2019-10-14 23:49:20,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8c899b8/1f2c5c06cab84a4e834bcb9d3b89cb4e/FLAG9dc373ceb [2019-10-14 23:49:21,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8c899b8/1f2c5c06cab84a4e834bcb9d3b89cb4e [2019-10-14 23:49:21,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:21,168 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:21,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:21,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:21,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:21,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19921db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21, skipping insertion in model container [2019-10-14 23:49:21,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,184 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:21,238 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:21,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:21,470 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:21,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:21,627 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:21,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21 WrapperNode [2019-10-14 23:49:21,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:21,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:21,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:21,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:21,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (1/1) ... [2019-10-14 23:49:21,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:21,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:21,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:21,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:21,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-14 23:49:21,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-14 23:49:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:21,952 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:22,430 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-14 23:49:22,431 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-14 23:49:22,449 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:22,450 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:22,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:22 BoogieIcfgContainer [2019-10-14 23:49:22,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:22,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:22,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:22,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:22,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:21" (1/3) ... [2019-10-14 23:49:22,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d37024a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:22, skipping insertion in model container [2019-10-14 23:49:22,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:21" (2/3) ... [2019-10-14 23:49:22,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d37024a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:22, skipping insertion in model container [2019-10-14 23:49:22,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:22" (3/3) ... [2019-10-14 23:49:22,460 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-10-14 23:49:22,471 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:22,479 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:22,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:22,518 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:22,518 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:22,519 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:22,519 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:22,519 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:22,519 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:22,520 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:22,520 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-10-14 23:49:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:49:22,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:22,552 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:22,554 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-10-14 23:49:22,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:22,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378326364] [2019-10-14 23:49:22,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:22,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:22,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378326364] [2019-10-14 23:49:22,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:22,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:22,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535543220] [2019-10-14 23:49:22,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:22,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:22,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:22,821 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-10-14 23:49:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:22,956 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-10-14 23:49:22,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:22,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:49:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:22,980 INFO L225 Difference]: With dead ends: 377 [2019-10-14 23:49:22,980 INFO L226 Difference]: Without dead ends: 220 [2019-10-14 23:49:22,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-14 23:49:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-14 23:49:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-14 23:49:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-10-14 23:49:23,056 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-10-14 23:49:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,056 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-10-14 23:49:23,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-10-14 23:49:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 23:49:23,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,060 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:23,060 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2019-10-14 23:49:23,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:23,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051148352] [2019-10-14 23:49:23,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:23,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051148352] [2019-10-14 23:49:23,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:23,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:23,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711859916] [2019-10-14 23:49:23,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:23,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:23,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:23,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,200 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-10-14 23:49:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:23,370 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-10-14 23:49:23,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:23,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-14 23:49:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:23,374 INFO L225 Difference]: With dead ends: 470 [2019-10-14 23:49:23,374 INFO L226 Difference]: Without dead ends: 262 [2019-10-14 23:49:23,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-14 23:49:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-10-14 23:49:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-14 23:49:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-10-14 23:49:23,397 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-10-14 23:49:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,397 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-10-14 23:49:23,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-10-14 23:49:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:49:23,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,401 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:23,401 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1578262845, now seen corresponding path program 1 times [2019-10-14 23:49:23,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:23,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872851588] [2019-10-14 23:49:23,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:49:23,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872851588] [2019-10-14 23:49:23,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:23,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:23,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283916014] [2019-10-14 23:49:23,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:23,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:23,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,496 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-10-14 23:49:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:23,720 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-10-14 23:49:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:23,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-14 23:49:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:23,725 INFO L225 Difference]: With dead ends: 598 [2019-10-14 23:49:23,725 INFO L226 Difference]: Without dead ends: 354 [2019-10-14 23:49:23,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-14 23:49:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-10-14 23:49:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-14 23:49:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-10-14 23:49:23,778 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-10-14 23:49:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:23,780 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-10-14 23:49:23,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-10-14 23:49:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-14 23:49:23,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:23,786 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:23,786 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:23,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash -227175489, now seen corresponding path program 1 times [2019-10-14 23:49:23,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:23,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216553250] [2019-10-14 23:49:23,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:23,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:49:23,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216553250] [2019-10-14 23:49:23,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:23,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:23,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371250724] [2019-10-14 23:49:23,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:23,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:23,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:23,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:23,908 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-10-14 23:49:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,049 INFO L93 Difference]: Finished difference Result 710 states and 1008 transitions. [2019-10-14 23:49:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-14 23:49:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,053 INFO L225 Difference]: With dead ends: 710 [2019-10-14 23:49:24,053 INFO L226 Difference]: Without dead ends: 386 [2019-10-14 23:49:24,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-10-14 23:49:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2019-10-14 23:49:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-14 23:49:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-10-14 23:49:24,070 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-10-14 23:49:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:24,071 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-10-14 23:49:24,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-10-14 23:49:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-14 23:49:24,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:24,075 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:24,075 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1103228957, now seen corresponding path program 1 times [2019-10-14 23:49:24,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:24,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802444831] [2019-10-14 23:49:24,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:49:24,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802444831] [2019-10-14 23:49:24,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667865076] [2019-10-14 23:49:24,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,155 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-10-14 23:49:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,361 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-10-14 23:49:24,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-14 23:49:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,365 INFO L225 Difference]: With dead ends: 842 [2019-10-14 23:49:24,365 INFO L226 Difference]: Without dead ends: 478 [2019-10-14 23:49:24,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-14 23:49:24,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-10-14 23:49:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-14 23:49:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-10-14 23:49:24,383 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-10-14 23:49:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:24,383 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-10-14 23:49:24,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-10-14 23:49:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:49:24,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:24,385 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:24,386 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1629529054, now seen corresponding path program 1 times [2019-10-14 23:49:24,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:24,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840217499] [2019-10-14 23:49:24,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-14 23:49:24,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840217499] [2019-10-14 23:49:24,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410848673] [2019-10-14 23:49:24,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,438 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-10-14 23:49:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,577 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-10-14 23:49:24,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-14 23:49:24,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,581 INFO L225 Difference]: With dead ends: 940 [2019-10-14 23:49:24,581 INFO L226 Difference]: Without dead ends: 500 [2019-10-14 23:49:24,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-14 23:49:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-10-14 23:49:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-14 23:49:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-10-14 23:49:24,597 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-10-14 23:49:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:24,597 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-10-14 23:49:24,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-10-14 23:49:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-14 23:49:24,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:24,600 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:24,600 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:24,600 INFO L82 PathProgramCache]: Analyzing trace with hash -233915046, now seen corresponding path program 1 times [2019-10-14 23:49:24,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:24,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961918069] [2019-10-14 23:49:24,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-14 23:49:24,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961918069] [2019-10-14 23:49:24,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042195513] [2019-10-14 23:49:24,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,668 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-10-14 23:49:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,707 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-10-14 23:49:24,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-14 23:49:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,712 INFO L225 Difference]: With dead ends: 976 [2019-10-14 23:49:24,712 INFO L226 Difference]: Without dead ends: 734 [2019-10-14 23:49:24,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-14 23:49:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-10-14 23:49:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-10-14 23:49:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-10-14 23:49:24,741 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-10-14 23:49:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:24,741 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-10-14 23:49:24,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-10-14 23:49:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-14 23:49:24,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:24,745 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:24,745 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash -674483159, now seen corresponding path program 1 times [2019-10-14 23:49:24,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:24,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765785789] [2019-10-14 23:49:24,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-14 23:49:24,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765785789] [2019-10-14 23:49:24,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215240078] [2019-10-14 23:49:24,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,844 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-10-14 23:49:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:24,883 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-10-14 23:49:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:24,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-14 23:49:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:24,890 INFO L225 Difference]: With dead ends: 976 [2019-10-14 23:49:24,890 INFO L226 Difference]: Without dead ends: 974 [2019-10-14 23:49:24,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-14 23:49:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-10-14 23:49:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-14 23:49:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-10-14 23:49:24,923 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-10-14 23:49:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:24,924 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-10-14 23:49:24,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-10-14 23:49:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-14 23:49:24,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:24,927 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:24,928 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:24,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2095197958, now seen corresponding path program 1 times [2019-10-14 23:49:24,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:24,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191371620] [2019-10-14 23:49:24,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:24,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-14 23:49:24,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191371620] [2019-10-14 23:49:24,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:24,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:24,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770469186] [2019-10-14 23:49:24,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:24,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:24,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:24,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:24,998 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-10-14 23:49:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:25,163 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-10-14 23:49:25,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:25,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-14 23:49:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:25,169 INFO L225 Difference]: With dead ends: 2140 [2019-10-14 23:49:25,169 INFO L226 Difference]: Without dead ends: 1170 [2019-10-14 23:49:25,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-10-14 23:49:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-10-14 23:49:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-14 23:49:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-10-14 23:49:25,204 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 139 [2019-10-14 23:49:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:25,205 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-10-14 23:49:25,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-10-14 23:49:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-14 23:49:25,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:25,209 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:25,209 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:25,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2111242741, now seen corresponding path program 1 times [2019-10-14 23:49:25,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:25,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317003886] [2019-10-14 23:49:25,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-14 23:49:25,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317003886] [2019-10-14 23:49:25,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:25,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:25,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619915668] [2019-10-14 23:49:25,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:25,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:25,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:25,288 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-10-14 23:49:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:25,427 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-10-14 23:49:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:25,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-14 23:49:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:25,435 INFO L225 Difference]: With dead ends: 2354 [2019-10-14 23:49:25,435 INFO L226 Difference]: Without dead ends: 1236 [2019-10-14 23:49:25,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-14 23:49:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-10-14 23:49:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-14 23:49:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-10-14 23:49:25,471 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 175 [2019-10-14 23:49:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:25,472 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-10-14 23:49:25,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-10-14 23:49:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-14 23:49:25,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:25,477 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:25,477 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash 834252520, now seen corresponding path program 1 times [2019-10-14 23:49:25,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:25,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370406577] [2019-10-14 23:49:25,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-14 23:49:25,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370406577] [2019-10-14 23:49:25,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:25,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:25,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117550345] [2019-10-14 23:49:25,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:25,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:25,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:25,546 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-10-14 23:49:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:25,680 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-10-14 23:49:25,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:25,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-14 23:49:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:25,688 INFO L225 Difference]: With dead ends: 2544 [2019-10-14 23:49:25,688 INFO L226 Difference]: Without dead ends: 1334 [2019-10-14 23:49:25,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-10-14 23:49:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-10-14 23:49:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-14 23:49:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-10-14 23:49:25,732 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 196 [2019-10-14 23:49:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:25,732 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-10-14 23:49:25,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-10-14 23:49:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-14 23:49:25,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:25,738 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:25,738 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:25,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1654542421, now seen corresponding path program 1 times [2019-10-14 23:49:25,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:25,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727153676] [2019-10-14 23:49:25,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:25,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-14 23:49:25,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727153676] [2019-10-14 23:49:25,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:25,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:25,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978797950] [2019-10-14 23:49:25,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:25,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:25,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:25,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:25,858 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-10-14 23:49:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:25,989 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-10-14 23:49:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:25,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-10-14 23:49:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:25,996 INFO L225 Difference]: With dead ends: 2752 [2019-10-14 23:49:25,996 INFO L226 Difference]: Without dead ends: 1442 [2019-10-14 23:49:25,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-10-14 23:49:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-10-14 23:49:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-14 23:49:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-10-14 23:49:26,036 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 220 [2019-10-14 23:49:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:26,037 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-10-14 23:49:26,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-10-14 23:49:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-14 23:49:26,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:26,042 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:26,043 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:26,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1609383977, now seen corresponding path program 1 times [2019-10-14 23:49:26,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:26,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261332420] [2019-10-14 23:49:26,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-14 23:49:26,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261332420] [2019-10-14 23:49:26,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:26,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:26,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927519333] [2019-10-14 23:49:26,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:26,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:26,126 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-10-14 23:49:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:26,281 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-10-14 23:49:26,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:26,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-10-14 23:49:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:26,289 INFO L225 Difference]: With dead ends: 2992 [2019-10-14 23:49:26,289 INFO L226 Difference]: Without dead ends: 1570 [2019-10-14 23:49:26,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-14 23:49:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-10-14 23:49:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-14 23:49:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-10-14 23:49:26,352 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 220 [2019-10-14 23:49:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:26,353 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-10-14 23:49:26,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-10-14 23:49:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-14 23:49:26,363 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:26,363 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:26,364 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1500640469, now seen corresponding path program 1 times [2019-10-14 23:49:26,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:26,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571679723] [2019-10-14 23:49:26,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-10-14 23:49:26,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571679723] [2019-10-14 23:49:26,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:26,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:26,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827084985] [2019-10-14 23:49:26,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:26,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:26,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:26,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:26,538 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-10-14 23:49:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:26,605 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-10-14 23:49:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:26,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-10-14 23:49:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:26,626 INFO L225 Difference]: With dead ends: 4646 [2019-10-14 23:49:26,626 INFO L226 Difference]: Without dead ends: 3100 [2019-10-14 23:49:26,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-10-14 23:49:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-10-14 23:49:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-10-14 23:49:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-10-14 23:49:26,742 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 250 [2019-10-14 23:49:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:26,743 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-10-14 23:49:26,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-10-14 23:49:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-14 23:49:26,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:26,759 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:26,759 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1763285929, now seen corresponding path program 1 times [2019-10-14 23:49:26,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:26,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488458072] [2019-10-14 23:49:26,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:26,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-14 23:49:26,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488458072] [2019-10-14 23:49:26,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:26,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:26,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776356369] [2019-10-14 23:49:26,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:26,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:26,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:26,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:26,970 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-10-14 23:49:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:27,199 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-10-14 23:49:27,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:27,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-10-14 23:49:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:27,221 INFO L225 Difference]: With dead ends: 6484 [2019-10-14 23:49:27,221 INFO L226 Difference]: Without dead ends: 3398 [2019-10-14 23:49:27,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-14 23:49:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-10-14 23:49:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-10-14 23:49:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-10-14 23:49:27,343 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 250 [2019-10-14 23:49:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:27,344 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-10-14 23:49:27,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-10-14 23:49:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-14 23:49:27,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:27,360 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:27,360 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1165577599, now seen corresponding path program 1 times [2019-10-14 23:49:27,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:27,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983515192] [2019-10-14 23:49:27,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:27,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:27,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-10-14 23:49:27,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983515192] [2019-10-14 23:49:27,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:27,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:27,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684813197] [2019-10-14 23:49:27,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:27,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:27,580 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-10-14 23:49:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:27,812 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-10-14 23:49:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:27,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-14 23:49:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:27,835 INFO L225 Difference]: With dead ends: 6900 [2019-10-14 23:49:27,835 INFO L226 Difference]: Without dead ends: 3530 [2019-10-14 23:49:27,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-10-14 23:49:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-10-14 23:49:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-10-14 23:49:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-10-14 23:49:27,973 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 274 [2019-10-14 23:49:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:27,974 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-10-14 23:49:27,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-10-14 23:49:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-14 23:49:27,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:27,990 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:27,990 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash -373875199, now seen corresponding path program 1 times [2019-10-14 23:49:27,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:27,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56551462] [2019-10-14 23:49:27,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:27,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:27,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-10-14 23:49:28,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56551462] [2019-10-14 23:49:28,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:28,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:28,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689054624] [2019-10-14 23:49:28,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:28,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:28,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:28,203 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-10-14 23:49:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:28,474 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-10-14 23:49:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:28,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2019-10-14 23:49:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:28,493 INFO L225 Difference]: With dead ends: 7416 [2019-10-14 23:49:28,494 INFO L226 Difference]: Without dead ends: 3914 [2019-10-14 23:49:28,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-10-14 23:49:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-10-14 23:49:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-10-14 23:49:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-10-14 23:49:28,653 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 285 [2019-10-14 23:49:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:28,654 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-10-14 23:49:28,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-10-14 23:49:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-14 23:49:28,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:28,665 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:28,665 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:28,666 INFO L82 PathProgramCache]: Analyzing trace with hash -233584477, now seen corresponding path program 1 times [2019-10-14 23:49:28,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:28,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706626502] [2019-10-14 23:49:28,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:28,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:28,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-14 23:49:28,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706626502] [2019-10-14 23:49:28,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:28,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:28,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341798686] [2019-10-14 23:49:28,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:28,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:28,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:28,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:28,800 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-10-14 23:49:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:28,982 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-10-14 23:49:28,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:28,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-10-14 23:49:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:29,022 INFO L225 Difference]: With dead ends: 8048 [2019-10-14 23:49:29,022 INFO L226 Difference]: Without dead ends: 4234 [2019-10-14 23:49:29,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-10-14 23:49:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-10-14 23:49:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-10-14 23:49:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-10-14 23:49:29,145 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 299 [2019-10-14 23:49:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:29,145 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-10-14 23:49:29,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-10-14 23:49:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-14 23:49:29,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:29,156 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:29,156 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash -110745964, now seen corresponding path program 1 times [2019-10-14 23:49:29,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:29,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421817642] [2019-10-14 23:49:29,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:29,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:29,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-10-14 23:49:29,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421817642] [2019-10-14 23:49:29,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:29,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:29,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344565556] [2019-10-14 23:49:29,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:29,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:29,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:29,354 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-10-14 23:49:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:29,445 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-10-14 23:49:29,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:29,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-14 23:49:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:29,473 INFO L225 Difference]: With dead ends: 11310 [2019-10-14 23:49:29,473 INFO L226 Difference]: Without dead ends: 7376 [2019-10-14 23:49:29,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-14 23:49:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-10-14 23:49:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-10-14 23:49:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-10-14 23:49:29,724 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 300 [2019-10-14 23:49:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:29,724 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-10-14 23:49:29,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-10-14 23:49:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-14 23:49:29,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:29,747 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:29,747 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 123119806, now seen corresponding path program 1 times [2019-10-14 23:49:29,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:29,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087057081] [2019-10-14 23:49:29,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:29,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:29,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2019-10-14 23:49:29,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087057081] [2019-10-14 23:49:29,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:29,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:29,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235812078] [2019-10-14 23:49:29,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:29,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:29,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:29,931 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-10-14 23:49:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:30,194 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-10-14 23:49:30,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:30,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-10-14 23:49:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:30,217 INFO L225 Difference]: With dead ends: 14744 [2019-10-14 23:49:30,218 INFO L226 Difference]: Without dead ends: 7382 [2019-10-14 23:49:30,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-10-14 23:49:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-10-14 23:49:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-10-14 23:49:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-10-14 23:49:30,413 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 301 [2019-10-14 23:49:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:30,414 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-10-14 23:49:30,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-10-14 23:49:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-14 23:49:30,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:30,428 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:30,429 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash -994522767, now seen corresponding path program 1 times [2019-10-14 23:49:30,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:30,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793465214] [2019-10-14 23:49:30,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:30,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-10-14 23:49:30,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793465214] [2019-10-14 23:49:30,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836220492] [2019-10-14 23:49:30,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:30,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:49:30,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2019-10-14 23:49:31,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:31,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-10-14 23:49:31,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991062742] [2019-10-14 23:49:31,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:31,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:49:31,044 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2019-10-14 23:49:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:31,332 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2019-10-14 23:49:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:31,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 324 [2019-10-14 23:49:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:31,348 INFO L225 Difference]: With dead ends: 14866 [2019-10-14 23:49:31,349 INFO L226 Difference]: Without dead ends: 7500 [2019-10-14 23:49:31,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:49:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2019-10-14 23:49:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2019-10-14 23:49:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-10-14 23:49:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-10-14 23:49:31,579 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 324 [2019-10-14 23:49:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:31,579 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-10-14 23:49:31,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-10-14 23:49:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-10-14 23:49:31,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:31,593 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:31,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:31,798 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash -697717157, now seen corresponding path program 1 times [2019-10-14 23:49:31,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:31,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081419803] [2019-10-14 23:49:31,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:31,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-10-14 23:49:32,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081419803] [2019-10-14 23:49:32,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287749058] [2019-10-14 23:49:32,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:32,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:32,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-10-14 23:49:32,593 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:32,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:32,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853511333] [2019-10-14 23:49:32,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:32,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:32,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:32,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:32,597 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2019-10-14 23:49:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:33,236 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2019-10-14 23:49:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:33,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-10-14 23:49:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:33,268 INFO L225 Difference]: With dead ends: 14624 [2019-10-14 23:49:33,268 INFO L226 Difference]: Without dead ends: 11034 [2019-10-14 23:49:33,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-10-14 23:49:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-10-14 23:49:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-10-14 23:49:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-10-14 23:49:33,663 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 337 [2019-10-14 23:49:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:33,664 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-10-14 23:49:33,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-10-14 23:49:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-14 23:49:33,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:33,687 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:33,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:33,892 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 233855425, now seen corresponding path program 2 times [2019-10-14 23:49:33,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:33,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923844016] [2019-10-14 23:49:33,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:33,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-14 23:49:34,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923844016] [2019-10-14 23:49:34,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131369555] [2019-10-14 23:49:34,158 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:34,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:49:34,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:49:34,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:34,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2019-10-14 23:49:34,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:34,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:34,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925884337] [2019-10-14 23:49:34,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:34,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:34,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:34,371 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 3 states. [2019-10-14 23:49:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:34,589 INFO L93 Difference]: Finished difference Result 16374 states and 21042 transitions. [2019-10-14 23:49:34,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:34,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-10-14 23:49:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:34,607 INFO L225 Difference]: With dead ends: 16374 [2019-10-14 23:49:34,607 INFO L226 Difference]: Without dead ends: 7932 [2019-10-14 23:49:34,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 352 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-10-14 23:49:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2019-10-14 23:49:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7684. [2019-10-14 23:49:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-10-14 23:49:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 9645 transitions. [2019-10-14 23:49:34,812 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 9645 transitions. Word has length 350 [2019-10-14 23:49:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:34,812 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 9645 transitions. [2019-10-14 23:49:34,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 9645 transitions. [2019-10-14 23:49:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-10-14 23:49:34,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:34,831 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:35,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:35,044 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash -382228618, now seen corresponding path program 1 times [2019-10-14 23:49:35,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:35,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856534409] [2019-10-14 23:49:35,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:35,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:35,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856534409] [2019-10-14 23:49:35,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359979286] [2019-10-14 23:49:35,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:35,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:35,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-14 23:49:35,577 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:35,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:35,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649004245] [2019-10-14 23:49:35,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:35,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:35,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:35,583 INFO L87 Difference]: Start difference. First operand 7684 states and 9645 transitions. Second operand 4 states. [2019-10-14 23:49:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:36,076 INFO L93 Difference]: Finished difference Result 17150 states and 21439 transitions. [2019-10-14 23:49:36,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:36,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-10-14 23:49:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:36,096 INFO L225 Difference]: With dead ends: 17150 [2019-10-14 23:49:36,097 INFO L226 Difference]: Without dead ends: 9476 [2019-10-14 23:49:36,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2019-10-14 23:49:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 7983. [2019-10-14 23:49:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7983 states. [2019-10-14 23:49:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 9971 transitions. [2019-10-14 23:49:36,276 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 9971 transitions. Word has length 381 [2019-10-14 23:49:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:36,277 INFO L462 AbstractCegarLoop]: Abstraction has 7983 states and 9971 transitions. [2019-10-14 23:49:36,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 9971 transitions. [2019-10-14 23:49:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-10-14 23:49:36,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:36,294 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:36,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:36,500 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:36,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:36,501 INFO L82 PathProgramCache]: Analyzing trace with hash 675475598, now seen corresponding path program 1 times [2019-10-14 23:49:36,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:36,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193158700] [2019-10-14 23:49:36,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:36,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-14 23:49:36,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193158700] [2019-10-14 23:49:36,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:36,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:36,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590159281] [2019-10-14 23:49:36,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:36,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:36,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:36,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:36,712 INFO L87 Difference]: Start difference. First operand 7983 states and 9971 transitions. Second operand 3 states. [2019-10-14 23:49:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:36,998 INFO L93 Difference]: Finished difference Result 15357 states and 18836 transitions. [2019-10-14 23:49:36,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:36,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-10-14 23:49:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:37,011 INFO L225 Difference]: With dead ends: 15357 [2019-10-14 23:49:37,011 INFO L226 Difference]: Without dead ends: 3807 [2019-10-14 23:49:37,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2019-10-14 23:49:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3549. [2019-10-14 23:49:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2019-10-14 23:49:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4386 transitions. [2019-10-14 23:49:37,102 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4386 transitions. Word has length 420 [2019-10-14 23:49:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:37,102 INFO L462 AbstractCegarLoop]: Abstraction has 3549 states and 4386 transitions. [2019-10-14 23:49:37,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4386 transitions. [2019-10-14 23:49:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-10-14 23:49:37,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:37,119 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:37,119 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash 331734252, now seen corresponding path program 1 times [2019-10-14 23:49:37,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:37,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663039161] [2019-10-14 23:49:37,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:37,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:37,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-10-14 23:49:37,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663039161] [2019-10-14 23:49:37,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144872483] [2019-10-14 23:49:37,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:37,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:37,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-10-14 23:49:37,675 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:37,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:37,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738135582] [2019-10-14 23:49:37,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:37,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:37,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:37,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:37,678 INFO L87 Difference]: Start difference. First operand 3549 states and 4386 transitions. Second operand 4 states. [2019-10-14 23:49:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:37,849 INFO L93 Difference]: Finished difference Result 4045 states and 5011 transitions. [2019-10-14 23:49:37,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:49:37,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2019-10-14 23:49:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:37,850 INFO L225 Difference]: With dead ends: 4045 [2019-10-14 23:49:37,850 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:49:37,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:49:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:49:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:49:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:49:37,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2019-10-14 23:49:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:37,856 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:49:37,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:49:37,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:49:38,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:38,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:49:38,784 WARN L191 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 98 [2019-10-14 23:49:40,019 WARN L191 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-10-14 23:49:40,050 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:49:40,050 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:49:40,050 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-10-14 23:49:40,051 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-10-14 23:49:40,051 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-10-14 23:49:40,051 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-10-14 23:49:40,051 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-10-14 23:49:40,051 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-10-14 23:49:40,051 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-10-14 23:49:40,052 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-10-14 23:49:40,052 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-14 23:49:40,052 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-14 23:49:40,053 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-10-14 23:49:40,053 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-10-14 23:49:40,053 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-10-14 23:49:40,053 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-10-14 23:49:40,053 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-10-14 23:49:40,053 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-10-14 23:49:40,053 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-10-14 23:49:40,055 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-10-14 23:49:40,055 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-10-14 23:49:40,055 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-10-14 23:49:40,055 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-10-14 23:49:40,056 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:40,057 INFO L443 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2019-10-14 23:49:40,057 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-14 23:49:40,057 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-10-14 23:49:40,057 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-14 23:49:40,057 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-10-14 23:49:40,058 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-10-14 23:49:40,058 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-10-14 23:49:40,058 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-10-14 23:49:40,058 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-10-14 23:49:40,059 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-10-14 23:49:40,059 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-10-14 23:49:40,059 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-10-14 23:49:40,059 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-10-14 23:49:40,059 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-10-14 23:49:40,059 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2019-10-14 23:49:40,059 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-10-14 23:49:40,060 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-10-14 23:49:40,060 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-10-14 23:49:40,060 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-10-14 23:49:40,060 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-10-14 23:49:40,061 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-10-14 23:49:40,061 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-10-14 23:49:40,061 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-10-14 23:49:40,061 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-10-14 23:49:40,061 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-10-14 23:49:40,061 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-10-14 23:49:40,061 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-10-14 23:49:40,062 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-10-14 23:49:40,062 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-10-14 23:49:40,062 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-10-14 23:49:40,062 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-10-14 23:49:40,062 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-10-14 23:49:40,062 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-10-14 23:49:40,062 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-10-14 23:49:40,062 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-14 23:49:40,063 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2019-10-14 23:49:40,063 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-10-14 23:49:40,063 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2019-10-14 23:49:40,063 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-10-14 23:49:40,063 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-10-14 23:49:40,063 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-10-14 23:49:40,063 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-10-14 23:49:40,063 INFO L443 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:40,064 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-10-14 23:49:40,064 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-10-14 23:49:40,064 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-10-14 23:49:40,064 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-10-14 23:49:40,064 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-10-14 23:49:40,064 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-14 23:49:40,064 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-10-14 23:49:40,065 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-10-14 23:49:40,065 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2019-10-14 23:49:40,065 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse10 (= 4464 ssl3_connect_~s__state~0)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse15 (= 4448 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8) (and .cse5 .cse0 .cse1) (and .cse9 .cse6 .cse1) (and .cse3 .cse10 .cse1) (and .cse6 .cse5) (and .cse3 .cse11 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse12) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse9 .cse3) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse1 .cse2) (and .cse10 .cse0 .cse1) (and .cse6 .cse11) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse13 .cse14) (and .cse11 .cse0 .cse1) (and .cse3 .cse1 .cse15) (and .cse6 (= 4400 ssl3_connect_~s__state~0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse13 .cse14 .cse1 .cse12) (and .cse4 .cse0 .cse1) (and .cse0 .cse1 (= 4416 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse15))) [2019-10-14 23:49:40,066 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-10-14 23:49:40,066 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-10-14 23:49:40,066 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-10-14 23:49:40,066 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-10-14 23:49:40,066 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-10-14 23:49:40,067 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-10-14 23:49:40,067 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-14 23:49:40,067 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:40,067 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-10-14 23:49:40,067 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:40,068 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-10-14 23:49:40,068 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-10-14 23:49:40,068 INFO L443 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2019-10-14 23:49:40,068 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-10-14 23:49:40,068 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-10-14 23:49:40,068 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-10-14 23:49:40,068 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-10-14 23:49:40,069 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-10-14 23:49:40,070 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 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 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (= ssl3_connect_~s__hit~0 0) .cse1 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2019-10-14 23:49:40,070 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-14 23:49:40,070 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-10-14 23:49:40,070 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-10-14 23:49:40,070 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-10-14 23:49:40,070 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-10-14 23:49:40,070 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-10-14 23:49:40,071 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-10-14 23:49:40,071 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-10-14 23:49:40,071 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-10-14 23:49:40,071 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2019-10-14 23:49:40,071 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-10-14 23:49:40,071 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-10-14 23:49:40,071 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-10-14 23:49:40,072 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-10-14 23:49:40,072 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-10-14 23:49:40,072 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-10-14 23:49:40,072 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-10-14 23:49:40,072 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-10-14 23:49:40,072 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2019-10-14 23:49:40,072 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-14 23:49:40,072 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-10-14 23:49:40,072 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-10-14 23:49:40,073 INFO L443 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2019-10-14 23:49:40,073 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:49:40,073 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:49:40,073 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:49:40,073 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:49:40,073 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-14 23:49:40,073 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-10-14 23:49:40,073 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-10-14 23:49:40,074 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-10-14 23:49:40,074 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-10-14 23:49:40,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:49:40 BoogieIcfgContainer [2019-10-14 23:49:40,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:49:40,121 INFO L168 Benchmark]: Toolchain (without parser) took 18949.34 ms. Allocated memory was 138.4 MB in the beginning and 832.0 MB in the end (delta: 693.6 MB). Free memory was 102.7 MB in the beginning and 143.0 MB in the end (delta: -40.3 MB). Peak memory consumption was 653.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:40,122 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:49:40,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.16 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.5 MB in the beginning and 178.3 MB in the end (delta: -75.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:40,123 INFO L168 Benchmark]: Boogie Preprocessor took 82.89 ms. Allocated memory is still 202.9 MB. Free memory was 178.3 MB in the beginning and 176.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:40,123 INFO L168 Benchmark]: RCFGBuilder took 737.73 ms. Allocated memory is still 202.9 MB. Free memory was 175.5 MB in the beginning and 129.5 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:40,124 INFO L168 Benchmark]: TraceAbstraction took 17662.45 ms. Allocated memory was 202.9 MB in the beginning and 832.0 MB in the end (delta: 629.1 MB). Free memory was 129.5 MB in the beginning and 143.0 MB in the end (delta: -13.4 MB). Peak memory consumption was 615.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:49:40,131 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 461.16 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.5 MB in the beginning and 178.3 MB in the end (delta: -75.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.89 ms. Allocated memory is still 202.9 MB. Free memory was 178.3 MB in the beginning and 176.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 737.73 ms. Allocated memory is still 202.9 MB. Free memory was 175.5 MB in the beginning and 129.5 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17662.45 ms. Allocated memory was 202.9 MB in the beginning and 832.0 MB in the end (delta: 629.1 MB). Free memory was 129.5 MB in the beginning and 143.0 MB in the end (delta: -13.4 MB). Peak memory consumption was 615.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 17.5s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 5225 SDtfs, 1861 SDslu, 3090 SDs, 0 SdLazy, 2633 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2016 GetRequests, 1977 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 5317 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 236 NumberOfFragments, 645 HoareAnnotationTreeSize, 26 FomulaSimplifications, 18017 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1778 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 7625 NumberOfCodeBlocks, 7625 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 7594 ConstructedInterpolants, 0 QuantifiedInterpolants, 2974956 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3560 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 31 InterpolantComputations, 23 PerfectInterpolantSequences, 27114/27199 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...