java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:17,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:17,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:17,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:17,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:17,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:17,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:17,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:17,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:17,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:17,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:17,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:17,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:17,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:17,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:17,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:17,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:17,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:17,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:17,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:17,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:17,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:17,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:17,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:17,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:17,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:17,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:17,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:17,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:17,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:17,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:17,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:17,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:17,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:17,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:17,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:17,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:17,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:17,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:17,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:17,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:17,164 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-13 19:50:17,181 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:17,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:17,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:17,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:17,183 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:17,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:17,185 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:17,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:17,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:17,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:17,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:17,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:17,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:17,187 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:17,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:17,188 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:17,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:17,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:17,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:17,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:17,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:17,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:17,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:17,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:17,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:17,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:17,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:17,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:17,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:17,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:17,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:17,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:17,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:17,480 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:17,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-13 19:50:17,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4269d531/090dc52e32e34921bec852448f87bd05/FLAGf360781d5 [2019-10-13 19:50:18,100 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:18,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-13 19:50:18,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4269d531/090dc52e32e34921bec852448f87bd05/FLAGf360781d5 [2019-10-13 19:50:18,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4269d531/090dc52e32e34921bec852448f87bd05 [2019-10-13 19:50:18,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:18,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:18,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:18,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:18,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:18,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:18,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4264f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18, skipping insertion in model container [2019-10-13 19:50:18,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:18,455 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:18,502 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:18,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:18,758 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:18,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:18,956 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:18,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18 WrapperNode [2019-10-13 19:50:18,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:18,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:18,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:18,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:18,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:18,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:18,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:18,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:18,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:19,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:19,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (1/1) ... [2019-10-13 19:50:19,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:19,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:19,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:19,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:19,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (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-13 19:50:19,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:19,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:19,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-13 19:50:19,081 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:19,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-13 19:50:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:19,244 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:19,799 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-13 19:50:19,799 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-13 19:50:19,811 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:19,811 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:19,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:19 BoogieIcfgContainer [2019-10-13 19:50:19,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:19,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:19,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:19,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:19,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:18" (1/3) ... [2019-10-13 19:50:19,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d36039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:19, skipping insertion in model container [2019-10-13 19:50:19,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:18" (2/3) ... [2019-10-13 19:50:19,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d36039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:19, skipping insertion in model container [2019-10-13 19:50:19,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:19" (3/3) ... [2019-10-13 19:50:19,822 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-10-13 19:50:19,831 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:19,840 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:19,851 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:19,880 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:19,880 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:19,880 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:19,881 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:19,881 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:19,881 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:19,881 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:19,882 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-10-13 19:50:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:50:19,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:19,914 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-13 19:50:19,917 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2007307722, now seen corresponding path program 1 times [2019-10-13 19:50:19,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:19,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374801387] [2019-10-13 19:50:19,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:19,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,144 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-13 19:50:20,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374801387] [2019-10-13 19:50:20,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:20,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:20,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690022154] [2019-10-13 19:50:20,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:20,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:20,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:20,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:20,171 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2019-10-13 19:50:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:20,324 INFO L93 Difference]: Finished difference Result 365 states and 622 transitions. [2019-10-13 19:50:20,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:20,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:50:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:20,343 INFO L225 Difference]: With dead ends: 365 [2019-10-13 19:50:20,343 INFO L226 Difference]: Without dead ends: 214 [2019-10-13 19:50:20,349 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-13 19:50:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-13 19:50:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-10-13 19:50:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-13 19:50:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-10-13 19:50:20,462 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 29 [2019-10-13 19:50:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:20,463 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-10-13 19:50:20,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-10-13 19:50:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 19:50:20,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:20,470 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-13 19:50:20,471 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:20,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:20,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1381474291, now seen corresponding path program 1 times [2019-10-13 19:50:20,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:20,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776722454] [2019-10-13 19:50:20,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,606 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-13 19:50:20,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776722454] [2019-10-13 19:50:20,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:20,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:20,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195821950] [2019-10-13 19:50:20,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:20,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:20,614 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-10-13 19:50:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:20,820 INFO L93 Difference]: Finished difference Result 460 states and 698 transitions. [2019-10-13 19:50:20,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:20,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 19:50:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:20,827 INFO L225 Difference]: With dead ends: 460 [2019-10-13 19:50:20,827 INFO L226 Difference]: Without dead ends: 258 [2019-10-13 19:50:20,832 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-13 19:50:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-13 19:50:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2019-10-13 19:50:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-13 19:50:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2019-10-13 19:50:20,869 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 43 [2019-10-13 19:50:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:20,869 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2019-10-13 19:50:20,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2019-10-13 19:50:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:50:20,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:20,876 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-13 19:50:20,876 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 632602009, now seen corresponding path program 1 times [2019-10-13 19:50:20,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:20,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968228074] [2019-10-13 19:50:20,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:20,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,000 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-13 19:50:21,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968228074] [2019-10-13 19:50:21,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:21,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:21,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074623614] [2019-10-13 19:50:21,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:21,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:21,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:21,003 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand 3 states. [2019-10-13 19:50:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:21,254 INFO L93 Difference]: Finished difference Result 584 states and 888 transitions. [2019-10-13 19:50:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:21,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 19:50:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:21,259 INFO L225 Difference]: With dead ends: 584 [2019-10-13 19:50:21,259 INFO L226 Difference]: Without dead ends: 346 [2019-10-13 19:50:21,264 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-13 19:50:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-13 19:50:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2019-10-13 19:50:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-10-13 19:50:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 464 transitions. [2019-10-13 19:50:21,306 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 464 transitions. Word has length 60 [2019-10-13 19:50:21,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:21,306 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 464 transitions. [2019-10-13 19:50:21,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 464 transitions. [2019-10-13 19:50:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 19:50:21,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:21,313 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-13 19:50:21,313 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1172836325, now seen corresponding path program 1 times [2019-10-13 19:50:21,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:21,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163123014] [2019-10-13 19:50:21,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,366 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-13 19:50:21,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163123014] [2019-10-13 19:50:21,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:21,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:21,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198763004] [2019-10-13 19:50:21,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:21,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:21,369 INFO L87 Difference]: Start difference. First operand 330 states and 464 transitions. Second operand 3 states. [2019-10-13 19:50:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:21,542 INFO L93 Difference]: Finished difference Result 694 states and 991 transitions. [2019-10-13 19:50:21,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:21,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 19:50:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:21,548 INFO L225 Difference]: With dead ends: 694 [2019-10-13 19:50:21,548 INFO L226 Difference]: Without dead ends: 376 [2019-10-13 19:50:21,549 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-13 19:50:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-13 19:50:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2019-10-13 19:50:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-13 19:50:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 512 transitions. [2019-10-13 19:50:21,575 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 512 transitions. Word has length 60 [2019-10-13 19:50:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:21,577 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 512 transitions. [2019-10-13 19:50:21,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 512 transitions. [2019-10-13 19:50:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 19:50:21,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:21,582 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] [2019-10-13 19:50:21,583 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash 244907033, now seen corresponding path program 1 times [2019-10-13 19:50:21,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:21,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869060197] [2019-10-13 19:50:21,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,658 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-13 19:50:21,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869060197] [2019-10-13 19:50:21,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:21,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:21,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949410008] [2019-10-13 19:50:21,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:21,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:21,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:21,663 INFO L87 Difference]: Start difference. First operand 368 states and 512 transitions. Second operand 3 states. [2019-10-13 19:50:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:21,876 INFO L93 Difference]: Finished difference Result 828 states and 1190 transitions. [2019-10-13 19:50:21,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:21,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-13 19:50:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:21,885 INFO L225 Difference]: With dead ends: 828 [2019-10-13 19:50:21,886 INFO L226 Difference]: Without dead ends: 470 [2019-10-13 19:50:21,887 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-13 19:50:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-13 19:50:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 446. [2019-10-13 19:50:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-13 19:50:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2019-10-13 19:50:21,915 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 72 [2019-10-13 19:50:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:21,916 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2019-10-13 19:50:21,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2019-10-13 19:50:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 19:50:21,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:21,918 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] [2019-10-13 19:50:21,919 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash -834546447, now seen corresponding path program 1 times [2019-10-13 19:50:21,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:21,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666480602] [2019-10-13 19:50:21,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:21,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:21,974 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-13 19:50:21,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666480602] [2019-10-13 19:50:21,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:21,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:21,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805783002] [2019-10-13 19:50:21,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:21,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:21,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:21,977 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand 3 states. [2019-10-13 19:50:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:22,114 INFO L93 Difference]: Finished difference Result 928 states and 1353 transitions. [2019-10-13 19:50:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:22,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-13 19:50:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:22,118 INFO L225 Difference]: With dead ends: 928 [2019-10-13 19:50:22,118 INFO L226 Difference]: Without dead ends: 494 [2019-10-13 19:50:22,119 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-13 19:50:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-13 19:50:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2019-10-13 19:50:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-13 19:50:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 698 transitions. [2019-10-13 19:50:22,145 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 698 transitions. Word has length 76 [2019-10-13 19:50:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:22,146 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 698 transitions. [2019-10-13 19:50:22,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 698 transitions. [2019-10-13 19:50:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 19:50:22,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:22,148 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] [2019-10-13 19:50:22,149 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash -532111447, now seen corresponding path program 1 times [2019-10-13 19:50:22,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:22,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101708495] [2019-10-13 19:50:22,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,223 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-13 19:50:22,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101708495] [2019-10-13 19:50:22,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:22,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:22,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836679600] [2019-10-13 19:50:22,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:22,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:22,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:22,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:22,226 INFO L87 Difference]: Start difference. First operand 488 states and 698 transitions. Second operand 3 states. [2019-10-13 19:50:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:22,275 INFO L93 Difference]: Finished difference Result 964 states and 1385 transitions. [2019-10-13 19:50:22,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:22,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-13 19:50:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:22,280 INFO L225 Difference]: With dead ends: 964 [2019-10-13 19:50:22,280 INFO L226 Difference]: Without dead ends: 725 [2019-10-13 19:50:22,281 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-13 19:50:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-13 19:50:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2019-10-13 19:50:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-10-13 19:50:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2019-10-13 19:50:22,302 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 96 [2019-10-13 19:50:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:22,303 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2019-10-13 19:50:22,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2019-10-13 19:50:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 19:50:22,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:22,305 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] [2019-10-13 19:50:22,305 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:22,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2130642131, now seen corresponding path program 1 times [2019-10-13 19:50:22,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:22,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608422033] [2019-10-13 19:50:22,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,360 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-13 19:50:22,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608422033] [2019-10-13 19:50:22,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:22,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:22,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260009536] [2019-10-13 19:50:22,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:22,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:22,362 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2019-10-13 19:50:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:22,414 INFO L93 Difference]: Finished difference Result 964 states and 1382 transitions. [2019-10-13 19:50:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:22,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-13 19:50:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:22,420 INFO L225 Difference]: With dead ends: 964 [2019-10-13 19:50:22,420 INFO L226 Difference]: Without dead ends: 962 [2019-10-13 19:50:22,421 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-13 19:50:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-10-13 19:50:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-10-13 19:50:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-13 19:50:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2019-10-13 19:50:22,465 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 98 [2019-10-13 19:50:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:22,466 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2019-10-13 19:50:22,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2019-10-13 19:50:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 19:50:22,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:22,470 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-13 19:50:22,470 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1135672730, now seen corresponding path program 1 times [2019-10-13 19:50:22,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:22,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683797913] [2019-10-13 19:50:22,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-13 19:50:22,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683797913] [2019-10-13 19:50:22,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:22,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:22,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312024347] [2019-10-13 19:50:22,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:22,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:22,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:22,577 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand 3 states. [2019-10-13 19:50:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:22,835 INFO L93 Difference]: Finished difference Result 2112 states and 3080 transitions. [2019-10-13 19:50:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:22,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-13 19:50:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:22,845 INFO L225 Difference]: With dead ends: 2112 [2019-10-13 19:50:22,845 INFO L226 Difference]: Without dead ends: 1154 [2019-10-13 19:50:22,849 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-13 19:50:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-10-13 19:50:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2019-10-13 19:50:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-10-13 19:50:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1620 transitions. [2019-10-13 19:50:22,894 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1620 transitions. Word has length 152 [2019-10-13 19:50:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:22,895 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 1620 transitions. [2019-10-13 19:50:22,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1620 transitions. [2019-10-13 19:50:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-13 19:50:22,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:22,905 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:22,905 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:22,906 INFO L82 PathProgramCache]: Analyzing trace with hash -862106901, now seen corresponding path program 1 times [2019-10-13 19:50:22,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:22,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514095478] [2019-10-13 19:50:22,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:22,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-13 19:50:23,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514095478] [2019-10-13 19:50:23,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:23,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:23,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452949884] [2019-10-13 19:50:23,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:23,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:23,018 INFO L87 Difference]: Start difference. First operand 1118 states and 1620 transitions. Second operand 3 states. [2019-10-13 19:50:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:23,174 INFO L93 Difference]: Finished difference Result 2330 states and 3354 transitions. [2019-10-13 19:50:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:23,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-13 19:50:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:23,182 INFO L225 Difference]: With dead ends: 2330 [2019-10-13 19:50:23,182 INFO L226 Difference]: Without dead ends: 1224 [2019-10-13 19:50:23,186 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-13 19:50:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-10-13 19:50:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1210. [2019-10-13 19:50:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-13 19:50:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1732 transitions. [2019-10-13 19:50:23,220 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1732 transitions. Word has length 188 [2019-10-13 19:50:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:23,221 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1732 transitions. [2019-10-13 19:50:23,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1732 transitions. [2019-10-13 19:50:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-13 19:50:23,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:23,227 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:23,227 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2139251602, now seen corresponding path program 1 times [2019-10-13 19:50:23,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:23,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287675059] [2019-10-13 19:50:23,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-13 19:50:23,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287675059] [2019-10-13 19:50:23,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:23,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:23,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191598879] [2019-10-13 19:50:23,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:23,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:23,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:23,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:23,297 INFO L87 Difference]: Start difference. First operand 1210 states and 1732 transitions. Second operand 3 states. [2019-10-13 19:50:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:23,443 INFO L93 Difference]: Finished difference Result 2520 states and 3596 transitions. [2019-10-13 19:50:23,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:23,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-13 19:50:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:23,451 INFO L225 Difference]: With dead ends: 2520 [2019-10-13 19:50:23,452 INFO L226 Difference]: Without dead ends: 1322 [2019-10-13 19:50:23,455 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-13 19:50:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-13 19:50:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1310. [2019-10-13 19:50:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-10-13 19:50:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1852 transitions. [2019-10-13 19:50:23,497 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1852 transitions. Word has length 209 [2019-10-13 19:50:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:23,498 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1852 transitions. [2019-10-13 19:50:23,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1852 transitions. [2019-10-13 19:50:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-13 19:50:23,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:23,504 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:23,504 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:23,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1924345883, now seen corresponding path program 1 times [2019-10-13 19:50:23,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:23,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289940946] [2019-10-13 19:50:23,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-13 19:50:23,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289940946] [2019-10-13 19:50:23,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:23,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:23,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710744605] [2019-10-13 19:50:23,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:23,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:23,638 INFO L87 Difference]: Start difference. First operand 1310 states and 1852 transitions. Second operand 3 states. [2019-10-13 19:50:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:23,830 INFO L93 Difference]: Finished difference Result 2728 states and 3848 transitions. [2019-10-13 19:50:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:23,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-13 19:50:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:23,838 INFO L225 Difference]: With dead ends: 2728 [2019-10-13 19:50:23,838 INFO L226 Difference]: Without dead ends: 1430 [2019-10-13 19:50:23,841 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-13 19:50:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-10-13 19:50:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1422. [2019-10-13 19:50:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-10-13 19:50:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1984 transitions. [2019-10-13 19:50:23,883 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1984 transitions. Word has length 233 [2019-10-13 19:50:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:23,884 INFO L462 AbstractCegarLoop]: Abstraction has 1422 states and 1984 transitions. [2019-10-13 19:50:23,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1984 transitions. [2019-10-13 19:50:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-13 19:50:23,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:23,892 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:23,892 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash -643476451, now seen corresponding path program 1 times [2019-10-13 19:50:23,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:23,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881717825] [2019-10-13 19:50:23,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:23,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-13 19:50:24,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881717825] [2019-10-13 19:50:24,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:24,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:24,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248233982] [2019-10-13 19:50:24,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:24,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:24,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:24,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:24,003 INFO L87 Difference]: Start difference. First operand 1422 states and 1984 transitions. Second operand 3 states. [2019-10-13 19:50:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:24,168 INFO L93 Difference]: Finished difference Result 2968 states and 4148 transitions. [2019-10-13 19:50:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:24,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-13 19:50:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:24,177 INFO L225 Difference]: With dead ends: 2968 [2019-10-13 19:50:24,177 INFO L226 Difference]: Without dead ends: 1558 [2019-10-13 19:50:24,180 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-13 19:50:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-10-13 19:50:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2019-10-13 19:50:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-10-13 19:50:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2128 transitions. [2019-10-13 19:50:24,227 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2128 transitions. Word has length 233 [2019-10-13 19:50:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:24,227 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 2128 transitions. [2019-10-13 19:50:24,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2128 transitions. [2019-10-13 19:50:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-13 19:50:24,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:24,234 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:24,234 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:24,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1388986723, now seen corresponding path program 1 times [2019-10-13 19:50:24,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:24,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640103326] [2019-10-13 19:50:24,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:24,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:24,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-13 19:50:24,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640103326] [2019-10-13 19:50:24,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:24,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:24,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896709422] [2019-10-13 19:50:24,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:24,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:24,340 INFO L87 Difference]: Start difference. First operand 1546 states and 2128 transitions. Second operand 3 states. [2019-10-13 19:50:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:24,520 INFO L93 Difference]: Finished difference Result 3232 states and 4464 transitions. [2019-10-13 19:50:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:24,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-13 19:50:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:24,530 INFO L225 Difference]: With dead ends: 3232 [2019-10-13 19:50:24,530 INFO L226 Difference]: Without dead ends: 1698 [2019-10-13 19:50:24,534 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-13 19:50:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-10-13 19:50:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1690. [2019-10-13 19:50:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-10-13 19:50:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2292 transitions. [2019-10-13 19:50:24,584 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2292 transitions. Word has length 263 [2019-10-13 19:50:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:24,585 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 2292 transitions. [2019-10-13 19:50:24,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2292 transitions. [2019-10-13 19:50:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-13 19:50:24,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:24,592 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:24,593 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:24,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1178835611, now seen corresponding path program 1 times [2019-10-13 19:50:24,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:24,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690501382] [2019-10-13 19:50:24,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:24,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:24,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-13 19:50:24,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690501382] [2019-10-13 19:50:24,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:24,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:24,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957442218] [2019-10-13 19:50:24,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:24,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:24,715 INFO L87 Difference]: Start difference. First operand 1690 states and 2292 transitions. Second operand 3 states. [2019-10-13 19:50:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:24,758 INFO L93 Difference]: Finished difference Result 5038 states and 6836 transitions. [2019-10-13 19:50:24,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:24,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-13 19:50:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:24,775 INFO L225 Difference]: With dead ends: 5038 [2019-10-13 19:50:24,776 INFO L226 Difference]: Without dead ends: 3360 [2019-10-13 19:50:24,780 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-13 19:50:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-10-13 19:50:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2019-10-13 19:50:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3358 states. [2019-10-13 19:50:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4555 transitions. [2019-10-13 19:50:24,862 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4555 transitions. Word has length 263 [2019-10-13 19:50:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:24,862 INFO L462 AbstractCegarLoop]: Abstraction has 3358 states and 4555 transitions. [2019-10-13 19:50:24,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4555 transitions. [2019-10-13 19:50:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-13 19:50:24,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:24,872 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:24,872 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash 554282629, now seen corresponding path program 1 times [2019-10-13 19:50:24,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:24,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611065829] [2019-10-13 19:50:24,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:24,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:24,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-10-13 19:50:25,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611065829] [2019-10-13 19:50:25,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:25,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:25,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249136890] [2019-10-13 19:50:25,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:25,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:25,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:25,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:25,012 INFO L87 Difference]: Start difference. First operand 3358 states and 4555 transitions. Second operand 3 states. [2019-10-13 19:50:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:25,185 INFO L93 Difference]: Finished difference Result 6852 states and 9306 transitions. [2019-10-13 19:50:25,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:25,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-13 19:50:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:25,204 INFO L225 Difference]: With dead ends: 6852 [2019-10-13 19:50:25,204 INFO L226 Difference]: Without dead ends: 3506 [2019-10-13 19:50:25,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-10-13 19:50:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-10-13 19:50:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-10-13 19:50:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4707 transitions. [2019-10-13 19:50:25,310 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4707 transitions. Word has length 287 [2019-10-13 19:50:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:25,311 INFO L462 AbstractCegarLoop]: Abstraction has 3490 states and 4707 transitions. [2019-10-13 19:50:25,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4707 transitions. [2019-10-13 19:50:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-13 19:50:25,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:25,328 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:25,328 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1163110431, now seen corresponding path program 1 times [2019-10-13 19:50:25,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:25,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266699248] [2019-10-13 19:50:25,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:25,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:25,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-13 19:50:25,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266699248] [2019-10-13 19:50:25,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:25,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:25,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005648324] [2019-10-13 19:50:25,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:25,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:25,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:25,517 INFO L87 Difference]: Start difference. First operand 3490 states and 4707 transitions. Second operand 3 states. [2019-10-13 19:50:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:25,846 INFO L93 Difference]: Finished difference Result 7360 states and 10062 transitions. [2019-10-13 19:50:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:25,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-13 19:50:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:25,871 INFO L225 Difference]: With dead ends: 7360 [2019-10-13 19:50:25,871 INFO L226 Difference]: Without dead ends: 3882 [2019-10-13 19:50:25,880 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-13 19:50:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-10-13 19:50:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3802. [2019-10-13 19:50:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2019-10-13 19:50:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5075 transitions. [2019-10-13 19:50:26,009 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5075 transitions. Word has length 298 [2019-10-13 19:50:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:26,010 INFO L462 AbstractCegarLoop]: Abstraction has 3802 states and 5075 transitions. [2019-10-13 19:50:26,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5075 transitions. [2019-10-13 19:50:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-13 19:50:26,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:26,028 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:26,028 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash -121210371, now seen corresponding path program 1 times [2019-10-13 19:50:26,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:26,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621944920] [2019-10-13 19:50:26,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:26,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:26,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-13 19:50:26,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621944920] [2019-10-13 19:50:26,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:26,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:26,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583637011] [2019-10-13 19:50:26,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:26,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:26,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:26,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:26,214 INFO L87 Difference]: Start difference. First operand 3802 states and 5075 transitions. Second operand 3 states. [2019-10-13 19:50:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:26,479 INFO L93 Difference]: Finished difference Result 7992 states and 10606 transitions. [2019-10-13 19:50:26,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:26,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-13 19:50:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:26,502 INFO L225 Difference]: With dead ends: 7992 [2019-10-13 19:50:26,502 INFO L226 Difference]: Without dead ends: 4202 [2019-10-13 19:50:26,512 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-13 19:50:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-10-13 19:50:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3922. [2019-10-13 19:50:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-10-13 19:50:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5219 transitions. [2019-10-13 19:50:26,644 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5219 transitions. Word has length 311 [2019-10-13 19:50:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:26,644 INFO L462 AbstractCegarLoop]: Abstraction has 3922 states and 5219 transitions. [2019-10-13 19:50:26,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5219 transitions. [2019-10-13 19:50:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-13 19:50:26,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:26,657 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:26,657 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash -828607418, now seen corresponding path program 1 times [2019-10-13 19:50:26,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:26,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440466761] [2019-10-13 19:50:26,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:26,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:26,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-13 19:50:26,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440466761] [2019-10-13 19:50:26,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:26,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:26,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911769865] [2019-10-13 19:50:26,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:26,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:26,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:26,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:26,809 INFO L87 Difference]: Start difference. First operand 3922 states and 5219 transitions. Second operand 3 states. [2019-10-13 19:50:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:26,900 INFO L93 Difference]: Finished difference Result 11238 states and 15033 transitions. [2019-10-13 19:50:26,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:26,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-13 19:50:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:26,918 INFO L225 Difference]: With dead ends: 11238 [2019-10-13 19:50:26,918 INFO L226 Difference]: Without dead ends: 7328 [2019-10-13 19:50:26,928 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-13 19:50:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-10-13 19:50:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7326. [2019-10-13 19:50:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-10-13 19:50:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9805 transitions. [2019-10-13 19:50:27,084 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9805 transitions. Word has length 312 [2019-10-13 19:50:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:27,084 INFO L462 AbstractCegarLoop]: Abstraction has 7326 states and 9805 transitions. [2019-10-13 19:50:27,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9805 transitions. [2019-10-13 19:50:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-13 19:50:27,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:27,100 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:27,100 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:27,100 INFO L82 PathProgramCache]: Analyzing trace with hash -935849662, now seen corresponding path program 1 times [2019-10-13 19:50:27,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:27,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801345813] [2019-10-13 19:50:27,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-13 19:50:27,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801345813] [2019-10-13 19:50:27,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:27,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:27,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822443721] [2019-10-13 19:50:27,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:27,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:27,288 INFO L87 Difference]: Start difference. First operand 7326 states and 9805 transitions. Second operand 3 states. [2019-10-13 19:50:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:27,576 INFO L93 Difference]: Finished difference Result 14648 states and 19586 transitions. [2019-10-13 19:50:27,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:27,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-10-13 19:50:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:27,601 INFO L225 Difference]: With dead ends: 14648 [2019-10-13 19:50:27,602 INFO L226 Difference]: Without dead ends: 7334 [2019-10-13 19:50:27,621 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-13 19:50:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-10-13 19:50:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 7302. [2019-10-13 19:50:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-10-13 19:50:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9525 transitions. [2019-10-13 19:50:27,824 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9525 transitions. Word has length 313 [2019-10-13 19:50:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:27,824 INFO L462 AbstractCegarLoop]: Abstraction has 7302 states and 9525 transitions. [2019-10-13 19:50:27,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9525 transitions. [2019-10-13 19:50:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-13 19:50:27,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:27,849 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:27,849 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:27,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:27,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1555626477, now seen corresponding path program 1 times [2019-10-13 19:50:27,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:27,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556110412] [2019-10-13 19:50:27,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 765 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-13 19:50:28,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556110412] [2019-10-13 19:50:28,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151874251] [2019-10-13 19:50:28,103 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-13 19:50:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:28,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:50:28,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-10-13 19:50:28,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:28,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:28,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723919193] [2019-10-13 19:50:28,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:28,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:28,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:28,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:28,554 INFO L87 Difference]: Start difference. First operand 7302 states and 9525 transitions. Second operand 3 states. [2019-10-13 19:50:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:28,759 INFO L93 Difference]: Finished difference Result 18220 states and 23754 transitions. [2019-10-13 19:50:28,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:28,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-10-13 19:50:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:28,786 INFO L225 Difference]: With dead ends: 18220 [2019-10-13 19:50:28,786 INFO L226 Difference]: Without dead ends: 10930 [2019-10-13 19:50:28,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2019-10-13 19:50:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 10930. [2019-10-13 19:50:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10930 states. [2019-10-13 19:50:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10930 states to 10930 states and 14229 transitions. [2019-10-13 19:50:29,213 INFO L78 Accepts]: Start accepts. Automaton has 10930 states and 14229 transitions. Word has length 336 [2019-10-13 19:50:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:29,214 INFO L462 AbstractCegarLoop]: Abstraction has 10930 states and 14229 transitions. [2019-10-13 19:50:29,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 10930 states and 14229 transitions. [2019-10-13 19:50:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-10-13 19:50:29,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:29,234 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 19:50:29,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:29,442 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash 451618901, now seen corresponding path program 1 times [2019-10-13 19:50:29,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:29,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012691343] [2019-10-13 19:50:29,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 767 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-13 19:50:29,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012691343] [2019-10-13 19:50:29,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920510029] [2019-10-13 19:50:29,620 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-13 19:50:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:50:29,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2019-10-13 19:50:29,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:29,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-10-13 19:50:29,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503218260] [2019-10-13 19:50:29,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:29,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:29,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:29,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:50:29,850 INFO L87 Difference]: Start difference. First operand 10930 states and 14229 transitions. Second operand 5 states. [2019-10-13 19:50:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:30,467 INFO L93 Difference]: Finished difference Result 22074 states and 28747 transitions. [2019-10-13 19:50:30,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:30,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 338 [2019-10-13 19:50:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:30,498 INFO L225 Difference]: With dead ends: 22074 [2019-10-13 19:50:30,499 INFO L226 Difference]: Without dead ends: 11128 [2019-10-13 19:50:30,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 338 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-13 19:50:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11128 states. [2019-10-13 19:50:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11128 to 10936. [2019-10-13 19:50:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10936 states. [2019-10-13 19:50:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10936 states to 10936 states and 14237 transitions. [2019-10-13 19:50:30,857 INFO L78 Accepts]: Start accepts. Automaton has 10936 states and 14237 transitions. Word has length 338 [2019-10-13 19:50:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:30,858 INFO L462 AbstractCegarLoop]: Abstraction has 10936 states and 14237 transitions. [2019-10-13 19:50:30,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 10936 states and 14237 transitions. [2019-10-13 19:50:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-13 19:50:30,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:30,884 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:31,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:31,098 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1817523371, now seen corresponding path program 1 times [2019-10-13 19:50:31,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:31,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392839769] [2019-10-13 19:50:31,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-13 19:50:31,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392839769] [2019-10-13 19:50:31,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60494496] [2019-10-13 19:50:31,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 19:50:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:31,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-13 19:50:31,604 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:31,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:31,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220701500] [2019-10-13 19:50:31,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:31,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:31,607 INFO L87 Difference]: Start difference. First operand 10936 states and 14237 transitions. Second operand 4 states. [2019-10-13 19:50:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:32,218 INFO L93 Difference]: Finished difference Result 21712 states and 28271 transitions. [2019-10-13 19:50:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:32,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2019-10-13 19:50:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:32,250 INFO L225 Difference]: With dead ends: 21712 [2019-10-13 19:50:32,250 INFO L226 Difference]: Without dead ends: 16372 [2019-10-13 19:50:32,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 354 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-13 19:50:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16372 states. [2019-10-13 19:50:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16372 to 12568. [2019-10-13 19:50:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12568 states. [2019-10-13 19:50:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 16457 transitions. [2019-10-13 19:50:32,517 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 16457 transitions. Word has length 350 [2019-10-13 19:50:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:32,518 INFO L462 AbstractCegarLoop]: Abstraction has 12568 states and 16457 transitions. [2019-10-13 19:50:32,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 16457 transitions. [2019-10-13 19:50:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-13 19:50:32,539 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:32,539 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:32,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:32,744 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash -299155883, now seen corresponding path program 2 times [2019-10-13 19:50:32,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:32,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914177829] [2019-10-13 19:50:32,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-13 19:50:32,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914177829] [2019-10-13 19:50:32,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618495362] [2019-10-13 19:50:32,927 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 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-13 19:50:33,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:50:33,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:50:33,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:33,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-13 19:50:33,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:33,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:33,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856946156] [2019-10-13 19:50:33,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:33,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:33,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:33,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:33,941 INFO L87 Difference]: Start difference. First operand 12568 states and 16457 transitions. Second operand 3 states. [2019-10-13 19:50:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:34,325 INFO L93 Difference]: Finished difference Result 24326 states and 31258 transitions. [2019-10-13 19:50:34,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:34,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-10-13 19:50:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:34,363 INFO L225 Difference]: With dead ends: 24326 [2019-10-13 19:50:34,363 INFO L226 Difference]: Without dead ends: 11776 [2019-10-13 19:50:34,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 364 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-13 19:50:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11776 states. [2019-10-13 19:50:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11776 to 11416. [2019-10-13 19:50:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-10-13 19:50:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 14321 transitions. [2019-10-13 19:50:34,703 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 14321 transitions. Word has length 362 [2019-10-13 19:50:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:34,704 INFO L462 AbstractCegarLoop]: Abstraction has 11416 states and 14321 transitions. [2019-10-13 19:50:34,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 14321 transitions. [2019-10-13 19:50:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-10-13 19:50:34,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:34,732 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:34,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:34,947 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2019228612, now seen corresponding path program 1 times [2019-10-13 19:50:34,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:34,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409186386] [2019-10-13 19:50:34,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:34,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:34,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-13 19:50:35,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409186386] [2019-10-13 19:50:35,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022951115] [2019-10-13 19:50:35,166 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-13 19:50:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:35,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:35,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-13 19:50:35,447 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:35,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:35,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670691487] [2019-10-13 19:50:35,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:35,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:35,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:35,451 INFO L87 Difference]: Start difference. First operand 11416 states and 14321 transitions. Second operand 4 states. [2019-10-13 19:50:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:35,894 INFO L93 Difference]: Finished difference Result 25352 states and 31647 transitions. [2019-10-13 19:50:35,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:50:35,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-10-13 19:50:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:35,926 INFO L225 Difference]: With dead ends: 25352 [2019-10-13 19:50:35,926 INFO L226 Difference]: Without dead ends: 13942 [2019-10-13 19:50:35,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 380 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-13 19:50:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13942 states. [2019-10-13 19:50:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13942 to 11694. [2019-10-13 19:50:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11694 states. [2019-10-13 19:50:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 14578 transitions. [2019-10-13 19:50:36,171 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 14578 transitions. Word has length 376 [2019-10-13 19:50:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:36,172 INFO L462 AbstractCegarLoop]: Abstraction has 11694 states and 14578 transitions. [2019-10-13 19:50:36,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 14578 transitions. [2019-10-13 19:50:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-10-13 19:50:36,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:36,189 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:36,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:36,394 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1965718292, now seen corresponding path program 1 times [2019-10-13 19:50:36,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:36,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810921590] [2019-10-13 19:50:36,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:36,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:36,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-13 19:50:36,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810921590] [2019-10-13 19:50:36,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:36,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:36,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255783544] [2019-10-13 19:50:36,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:36,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:36,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:36,612 INFO L87 Difference]: Start difference. First operand 11694 states and 14578 transitions. Second operand 3 states. [2019-10-13 19:50:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:36,870 INFO L93 Difference]: Finished difference Result 22624 states and 27701 transitions. [2019-10-13 19:50:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:36,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2019-10-13 19:50:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:36,887 INFO L225 Difference]: With dead ends: 22624 [2019-10-13 19:50:36,887 INFO L226 Difference]: Without dead ends: 5426 [2019-10-13 19:50:36,906 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-13 19:50:36,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-10-13 19:50:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 5193. [2019-10-13 19:50:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2019-10-13 19:50:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6407 transitions. [2019-10-13 19:50:37,135 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6407 transitions. Word has length 415 [2019-10-13 19:50:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:37,136 INFO L462 AbstractCegarLoop]: Abstraction has 5193 states and 6407 transitions. [2019-10-13 19:50:37,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6407 transitions. [2019-10-13 19:50:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-10-13 19:50:37,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:37,152 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:37,153 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1027355828, now seen corresponding path program 1 times [2019-10-13 19:50:37,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:37,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514025158] [2019-10-13 19:50:37,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:37,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:37,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-13 19:50:37,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514025158] [2019-10-13 19:50:37,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411492665] [2019-10-13 19:50:37,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:37,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:37,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-10-13 19:50:38,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:38,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:38,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626842326] [2019-10-13 19:50:38,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:38,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:38,161 INFO L87 Difference]: Start difference. First operand 5193 states and 6407 transitions. Second operand 3 states. [2019-10-13 19:50:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:38,223 INFO L93 Difference]: Finished difference Result 5268 states and 6502 transitions. [2019-10-13 19:50:38,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:38,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-10-13 19:50:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:38,234 INFO L225 Difference]: With dead ends: 5268 [2019-10-13 19:50:38,234 INFO L226 Difference]: Without dead ends: 5192 [2019-10-13 19:50:38,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2019-10-13 19:50:38,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 5119. [2019-10-13 19:50:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5119 states. [2019-10-13 19:50:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6316 transitions. [2019-10-13 19:50:38,387 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6316 transitions. Word has length 499 [2019-10-13 19:50:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:38,388 INFO L462 AbstractCegarLoop]: Abstraction has 5119 states and 6316 transitions. [2019-10-13 19:50:38,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6316 transitions. [2019-10-13 19:50:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-10-13 19:50:38,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:38,404 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:38,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:38,611 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash -241116614, now seen corresponding path program 1 times [2019-10-13 19:50:38,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:38,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073223875] [2019-10-13 19:50:38,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:38,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:38,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-13 19:50:38,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073223875] [2019-10-13 19:50:38,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852597902] [2019-10-13 19:50:38,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:39,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:39,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-13 19:50:39,511 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:39,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:39,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121810547] [2019-10-13 19:50:39,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:39,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:39,514 INFO L87 Difference]: Start difference. First operand 5119 states and 6316 transitions. Second operand 4 states. [2019-10-13 19:50:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:39,693 INFO L93 Difference]: Finished difference Result 5614 states and 6940 transitions. [2019-10-13 19:50:39,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:50:39,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 609 [2019-10-13 19:50:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:39,694 INFO L225 Difference]: With dead ends: 5614 [2019-10-13 19:50:39,694 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:50:39,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 613 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-13 19:50:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:50:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:50:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:50:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:50:39,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2019-10-13 19:50:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:39,703 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:50:39,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:50:39,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:50:39,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:39,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:50:41,517 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 601 DAG size of output: 131 [2019-10-13 19:50:42,025 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-10-13 19:50:43,382 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-10-13 19:50:43,816 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2019-10-13 19:50:44,014 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-10-13 19:50:44,169 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-10-13 19:50:44,331 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-10-13 19:50:44,456 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-10-13 19:50:44,578 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-10-13 19:50:44,821 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-10-13 19:50:44,824 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:50:44,824 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:50:44,825 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-10-13 19:50:44,825 INFO L443 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-10-13 19:50:44,825 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-10-13 19:50:44,825 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-10-13 19:50:44,825 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-10-13 19:50:44,825 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-10-13 19:50:44,825 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-10-13 19:50:44,826 INFO L443 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-10-13 19:50:44,826 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-10-13 19:50:44,826 INFO L443 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-10-13 19:50:44,826 INFO L439 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-13 19:50:44,826 INFO L439 ceAbstractionStarter]: At program point L170(lines 166 541) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-13 19:50:44,827 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-10-13 19:50:44,827 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-10-13 19:50:44,827 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-10-13 19:50:44,827 INFO L443 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-10-13 19:50:44,827 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-10-13 19:50:44,827 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-10-13 19:50:44,828 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-10-13 19:50:44,828 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-10-13 19:50:44,828 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-10-13 19:50:44,828 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-10-13 19:50:44,828 INFO L439 ceAbstractionStarter]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)))) [2019-10-13 19:50:44,828 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-10-13 19:50:44,829 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-10-13 19:50:44,829 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-10-13 19:50:44,829 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-10-13 19:50:44,829 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-10-13 19:50:44,829 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-10-13 19:50:44,829 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-10-13 19:50:44,829 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-10-13 19:50:44,830 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-10-13 19:50:44,830 INFO L443 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-10-13 19:50:44,830 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-10-13 19:50:44,830 INFO L439 ceAbstractionStarter]: At program point L176(lines 172 539) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-10-13 19:50:44,830 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-10-13 19:50:44,830 INFO L443 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-10-13 19:50:44,831 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-10-13 19:50:44,831 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-10-13 19:50:44,831 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-10-13 19:50:44,831 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-10-13 19:50:44,831 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-10-13 19:50:44,831 INFO L443 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-10-13 19:50:44,832 INFO L439 ceAbstractionStarter]: At program point L146(lines 142 549) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-13 19:50:44,832 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-10-13 19:50:44,832 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-10-13 19:50:44,832 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-10-13 19:50:44,832 INFO L439 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-13 19:50:44,832 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-10-13 19:50:44,832 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-10-13 19:50:44,833 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-10-13 19:50:44,833 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-10-13 19:50:44,833 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-10-13 19:50:44,833 INFO L443 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-10-13 19:50:44,833 INFO L439 ceAbstractionStarter]: At program point L182(lines 178 537) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-13 19:50:44,834 INFO L439 ceAbstractionStarter]: At program point L116(lines 112 559) 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-13 19:50:44,834 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-10-13 19:50:44,834 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-10-13 19:50:44,834 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-10-13 19:50:44,834 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-10-13 19:50:44,834 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-10-13 19:50:44,835 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 609) the Hoare annotation is: true [2019-10-13 19:50:44,835 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-10-13 19:50:44,835 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-10-13 19:50:44,835 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-10-13 19:50:44,835 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-10-13 19:50:44,835 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-10-13 19:50:44,835 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-10-13 19:50:44,835 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-10-13 19:50:44,836 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-10-13 19:50:44,836 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-10-13 19:50:44,836 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-10-13 19:50:44,836 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-10-13 19:50:44,836 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-10-13 19:50:44,836 INFO L439 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4560 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse1 .cse3 (not .cse2)))) [2019-10-13 19:50:44,837 INFO L439 ceAbstractionStarter]: At program point L122(lines 118 557) 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-13 19:50:44,837 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-10-13 19:50:44,837 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-10-13 19:50:44,837 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-10-13 19:50:44,837 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-10-13 19:50:44,837 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-10-13 19:50:44,837 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-10-13 19:50:44,838 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-10-13 19:50:44,838 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-10-13 19:50:44,838 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-10-13 19:50:44,838 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-10-13 19:50:44,838 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-10-13 19:50:44,838 INFO L439 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse2 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ssl3_connect_~s__state~0)) (.cse4 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2 .cse3 (not .cse4)))) [2019-10-13 19:50:44,839 INFO L439 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3))) [2019-10-13 19:50:44,839 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 609) no Hoare annotation was computed. [2019-10-13 19:50:44,839 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-10-13 19:50:44,839 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-10-13 19:50:44,839 INFO L443 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-10-13 19:50:44,839 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 609) no Hoare annotation was computed. [2019-10-13 19:50:44,840 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-10-13 19:50:44,840 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-10-13 19:50:44,840 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-10-13 19:50:44,840 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-10-13 19:50:44,840 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-10-13 19:50:44,840 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-10-13 19:50:44,840 INFO L446 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-10-13 19:50:44,841 INFO L439 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-13 19:50:44,841 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-10-13 19:50:44,841 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-10-13 19:50:44,841 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-10-13 19:50:44,841 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-10-13 19:50:44,842 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-10-13 19:50:44,842 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-10-13 19:50:44,842 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-10-13 19:50:44,842 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-10-13 19:50:44,842 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-10-13 19:50:44,842 INFO L443 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-10-13 19:50:44,842 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-10-13 19:50:44,843 INFO L439 ceAbstractionStarter]: At program point L164(lines 160 543) 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)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2019-10-13 19:50:44,843 INFO L439 ceAbstractionStarter]: At program point L98(lines 97 564) 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-13 19:50:44,844 INFO L439 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse3 (= ssl3_connect_~s__hit~0 0))) (let ((.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0)) (.cse7 (= 4448 ssl3_connect_~s__state~0)) (.cse10 (not .cse3)) (.cse16 (<= 4560 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4512)) (.cse8 (<= ssl3_connect_~s__state~0 3)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse11 (= ssl3_connect_~s__state~0 4480)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse15 (= ssl3_connect_~s__state~0 4496)) (.cse19 (= 4416 ssl3_connect_~s__state~0)) (.cse14 (= 4400 ssl3_connect_~s__state~0)) (.cse18 (= 4464 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~blastFlag~0 4)) (.cse5 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse20 (= ssl3_connect_~s__state~0 4432))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7) (and .cse8 .cse6 .cse0) (and .cse0 .cse9 .cse3 .cse5) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse10) (and .cse6 .cse3 .cse11) (and .cse8 .cse6 .cse3) (and .cse0 .cse12 .cse3 .cse5) (and .cse6 .cse9) (and .cse0 .cse3 .cse7 .cse5) (and .cse0 .cse3 .cse5 .cse11) (and .cse0 .cse13 .cse14 .cse3 .cse5) (and .cse6 .cse12) (and .cse6 .cse15 .cse3) (and .cse6 .cse0 .cse16 .cse17 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse13 .cse3 .cse7 .cse5) (and .cse6 .cse16 .cse17 .cse10) (and .cse0 .cse18 .cse3 .cse5) (and .cse0 .cse16 .cse3 .cse17 .cse4 .cse5) (and .cse15 .cse13 .cse3 .cse5) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse9 .cse13 .cse3 .cse5) (and .cse8 .cse0 .cse5) (and .cse13 .cse3 .cse5 .cse19) (and .cse12 .cse13 .cse3 .cse5) (and .cse13 .cse3 .cse5 .cse11) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse0 .cse15 .cse3 .cse5) (and .cse6 .cse18 .cse3) (and .cse6 .cse3 .cse19) (and .cse6 .cse14 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse20 .cse13 .cse3 .cse5) (and .cse18 .cse13 .cse3 .cse5) (and .cse6 .cse20 .cse3)))) [2019-10-13 19:50:44,844 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-10-13 19:50:44,844 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-10-13 19:50:44,844 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-10-13 19:50:44,844 INFO L446 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-10-13 19:50:44,844 INFO L439 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-10-13 19:50:44,844 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:50:44,845 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:50:44,845 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:50:44,845 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:50:44,845 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 610 620) the Hoare annotation is: true [2019-10-13 19:50:44,845 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 610 620) no Hoare annotation was computed. [2019-10-13 19:50:44,845 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 610 620) no Hoare annotation was computed. [2019-10-13 19:50:44,845 INFO L439 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-13 19:50:44,846 INFO L443 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2019-10-13 19:50:44,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:50:44 BoogieIcfgContainer [2019-10-13 19:50:44,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:50:44,904 INFO L168 Benchmark]: Toolchain (without parser) took 26461.11 ms. Allocated memory was 141.6 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 100.5 MB in the beginning and 184.6 MB in the end (delta: -84.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-10-13 19:50:44,905 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 141.6 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:50:44,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.14 ms. Allocated memory was 141.6 MB in the beginning and 203.4 MB in the end (delta: 61.9 MB). Free memory was 100.3 MB in the beginning and 179.6 MB in the end (delta: -79.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:44,906 INFO L168 Benchmark]: Boogie Preprocessor took 53.58 ms. Allocated memory is still 203.4 MB. Free memory was 179.6 MB in the beginning and 176.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:44,906 INFO L168 Benchmark]: RCFGBuilder took 801.21 ms. Allocated memory is still 203.4 MB. Free memory was 176.9 MB in the beginning and 135.6 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:44,907 INFO L168 Benchmark]: TraceAbstraction took 25088.03 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 134.9 MB in the beginning and 184.6 MB in the end (delta: -49.7 MB). Peak memory consumption was 992.1 MB. Max. memory is 7.1 GB. [2019-10-13 19:50:44,912 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.49 ms. Allocated memory is still 141.6 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 514.14 ms. Allocated memory was 141.6 MB in the beginning and 203.4 MB in the end (delta: 61.9 MB). Free memory was 100.3 MB in the beginning and 179.6 MB in the end (delta: -79.2 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.58 ms. Allocated memory is still 203.4 MB. Free memory was 179.6 MB in the beginning and 176.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.21 ms. Allocated memory is still 203.4 MB. Free memory was 176.9 MB in the beginning and 135.6 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25088.03 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 134.9 MB in the beginning and 184.6 MB in the end (delta: -49.7 MB). Peak memory consumption was 992.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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: 136]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 178]: 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) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 160]: 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) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || ((blastFlag <= 2 && s__hit == 0) && 4448 == s__state)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 2 && s__hit == 0) && s__state == 4480)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 2 && s__state == 4512)) || (((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state == 4480)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 2 && s__state == 4528)) || ((blastFlag <= 2 && s__state == 4496) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__state == 4496 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 0 && s__state == 4368)) || (((s__state == 4512 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4416 == s__state)) || (((s__state == 4528 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state == 4480)) || (blastFlag <= 2 && 4384 == s__state)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && 4464 == s__state) && s__hit == 0)) || ((blastFlag <= 2 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || (((s__state == 4432 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((4464 == s__state && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && s__state == 4432) && s__hit == 0) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || !(12292 <= \old(initial_state))) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: 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) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 132 locations, 1 error locations. Result: SAFE, OverallTime: 24.9s, OverallIterations: 28, TraceHistogramMax: 21, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, HoareTripleCheckerStatistics: 5657 SDtfs, 1964 SDslu, 3229 SDs, 0 SdLazy, 2642 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3017 GetRequests, 2972 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12568occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 7476 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 336 NumberOfFragments, 1153 HoareAnnotationTreeSize, 26 FomulaSimplifications, 32104 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 26 FomulaSimplificationsInter, 3841 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 9751 NumberOfCodeBlocks, 9751 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 9716 ConstructedInterpolants, 0 QuantifiedInterpolants, 5259474 SizeOfPredicates, 10 NumberOfNonLiveVariables, 4633 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 35 InterpolantComputations, 25 PerfectInterpolantSequences, 40521/40626 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...