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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:32,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:32,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:32,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:32,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:32,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:32,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:32,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:32,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:32,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:32,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:32,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:32,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:32,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:32,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:32,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:32,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:32,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:32,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:32,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:32,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:32,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:32,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:32,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:32,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:32,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:32,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:32,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:32,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:32,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:32,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:32,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:32,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:32,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:32,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:32,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:32,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:32,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:32,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:32,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:32,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:32,315 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-15 01:27:32,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:32,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:32,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:32,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:32,356 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:32,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:32,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:32,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:32,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:32,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:32,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:32,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:32,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:32,360 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:32,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:32,360 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:32,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:32,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:32,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:32,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:32,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:32,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:32,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:32,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:32,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:32,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:32,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:32,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:32,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:27:32,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:32,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:32,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:32,667 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:32,667 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:32,668 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-15 01:27:32,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f3c7d06/1bdab24f047f4324b26c971a949b4cc6/FLAG2d0ccb895 [2019-10-15 01:27:33,258 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:27:33,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-15 01:27:33,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f3c7d06/1bdab24f047f4324b26c971a949b4cc6/FLAG2d0ccb895 [2019-10-15 01:27:33,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f3c7d06/1bdab24f047f4324b26c971a949b4cc6 [2019-10-15 01:27:33,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:27:33,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:27:33,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:33,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:27:33,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:27:33,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:33" (1/1) ... [2019-10-15 01:27:33,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9809d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:33, skipping insertion in model container [2019-10-15 01:27:33,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:33" (1/1) ... [2019-10-15 01:27:33,636 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:27:33,694 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:27:33,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:33,927 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:27:34,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:34,093 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:27:34,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34 WrapperNode [2019-10-15 01:27:34,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:34,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:27:34,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:27:34,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:27:34,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (1/1) ... [2019-10-15 01:27:34,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (1/1) ... [2019-10-15 01:27:34,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (1/1) ... [2019-10-15 01:27:34,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (1/1) ... [2019-10-15 01:27:34,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (1/1) ... [2019-10-15 01:27:34,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (1/1) ... [2019-10-15 01:27:34,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (1/1) ... [2019-10-15 01:27:34,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:27:34,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:27:34,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:27:34,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:27:34,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (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-15 01:27:34,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:27:34,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:27:34,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 01:27:34,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:27:34,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:27:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:27:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:27:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:27:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:27:34,224 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 01:27:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:27:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:27:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:27:34,495 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:27:34,980 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 01:27:34,981 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 01:27:34,993 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:27:34,993 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:27:34,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:34 BoogieIcfgContainer [2019-10-15 01:27:34,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:27:34,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:27:34,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:27:35,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:27:35,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:27:33" (1/3) ... [2019-10-15 01:27:35,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53530707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:35, skipping insertion in model container [2019-10-15 01:27:35,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:34" (2/3) ... [2019-10-15 01:27:35,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53530707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:35, skipping insertion in model container [2019-10-15 01:27:35,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:34" (3/3) ... [2019-10-15 01:27:35,004 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-10-15 01:27:35,014 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:27:35,024 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:27:35,036 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:27:35,066 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:27:35,066 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:27:35,066 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:27:35,067 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:27:35,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:27:35,067 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:27:35,067 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:27:35,067 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:27:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-10-15 01:27:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:27:35,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:35,121 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-15 01:27:35,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:35,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:35,130 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2019-10-15 01:27:35,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:35,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304159336] [2019-10-15 01:27:35,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:35,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:35,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:35,390 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-15 01:27:35,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304159336] [2019-10-15 01:27:35,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:35,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:35,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539179499] [2019-10-15 01:27:35,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:35,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:35,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:35,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:35,419 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2019-10-15 01:27:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:35,566 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2019-10-15 01:27:35,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:35,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:27:35,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:35,598 INFO L225 Difference]: With dead ends: 374 [2019-10-15 01:27:35,598 INFO L226 Difference]: Without dead ends: 218 [2019-10-15 01:27:35,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-15 01:27:35,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-10-15 01:27:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-15 01:27:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2019-10-15 01:27:35,725 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2019-10-15 01:27:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:35,727 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2019-10-15 01:27:35,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2019-10-15 01:27:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:27:35,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:35,733 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-15 01:27:35,733 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:35,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2019-10-15 01:27:35,735 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:35,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689492593] [2019-10-15 01:27:35,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:35,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:35,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:35,875 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-15 01:27:35,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689492593] [2019-10-15 01:27:35,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:35,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:35,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041326005] [2019-10-15 01:27:35,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:35,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:35,882 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2019-10-15 01:27:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:36,087 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2019-10-15 01:27:36,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:36,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 01:27:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:36,091 INFO L225 Difference]: With dead ends: 466 [2019-10-15 01:27:36,091 INFO L226 Difference]: Without dead ends: 260 [2019-10-15 01:27:36,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-15 01:27:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-10-15 01:27:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-15 01:27:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2019-10-15 01:27:36,123 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2019-10-15 01:27:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:36,124 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2019-10-15 01:27:36,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2019-10-15 01:27:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:36,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:36,130 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-15 01:27:36,133 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2019-10-15 01:27:36,134 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:36,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344613420] [2019-10-15 01:27:36,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:36,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:36,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:36,287 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-15 01:27:36,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344613420] [2019-10-15 01:27:36,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:36,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:36,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011129469] [2019-10-15 01:27:36,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:36,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:36,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:36,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:36,291 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2019-10-15 01:27:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:36,545 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2019-10-15 01:27:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:36,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:36,549 INFO L225 Difference]: With dead ends: 594 [2019-10-15 01:27:36,549 INFO L226 Difference]: Without dead ends: 352 [2019-10-15 01:27:36,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-15 01:27:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-10-15 01:27:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-15 01:27:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2019-10-15 01:27:36,570 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2019-10-15 01:27:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:36,571 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2019-10-15 01:27:36,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2019-10-15 01:27:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:36,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:36,574 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-15 01:27:36,575 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2019-10-15 01:27:36,575 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:36,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095396051] [2019-10-15 01:27:36,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:36,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:36,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:36,658 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-15 01:27:36,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095396051] [2019-10-15 01:27:36,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:36,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:36,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624143296] [2019-10-15 01:27:36,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:36,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:36,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:36,661 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2019-10-15 01:27:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:36,828 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2019-10-15 01:27:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:36,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:36,832 INFO L225 Difference]: With dead ends: 702 [2019-10-15 01:27:36,832 INFO L226 Difference]: Without dead ends: 380 [2019-10-15 01:27:36,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-15 01:27:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2019-10-15 01:27:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-15 01:27:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2019-10-15 01:27:36,853 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2019-10-15 01:27:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:36,853 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2019-10-15 01:27:36,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2019-10-15 01:27:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 01:27:36,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:36,858 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:36,858 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2019-10-15 01:27:36,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:36,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680782554] [2019-10-15 01:27:36,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:36,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:36,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:36,958 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-15 01:27:36,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680782554] [2019-10-15 01:27:36,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:36,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:36,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015470441] [2019-10-15 01:27:36,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:36,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:36,961 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2019-10-15 01:27:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:37,175 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2019-10-15 01:27:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:37,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-15 01:27:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:37,179 INFO L225 Difference]: With dead ends: 838 [2019-10-15 01:27:37,179 INFO L226 Difference]: Without dead ends: 476 [2019-10-15 01:27:37,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-15 01:27:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2019-10-15 01:27:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-15 01:27:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2019-10-15 01:27:37,198 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2019-10-15 01:27:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:37,198 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2019-10-15 01:27:37,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2019-10-15 01:27:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:27:37,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:37,201 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-15 01:27:37,201 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:37,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2019-10-15 01:27:37,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:37,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085467554] [2019-10-15 01:27:37,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:37,250 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-15 01:27:37,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085467554] [2019-10-15 01:27:37,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:37,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:37,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549776659] [2019-10-15 01:27:37,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:37,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:37,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,253 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2019-10-15 01:27:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:37,398 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2019-10-15 01:27:37,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:37,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-15 01:27:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:37,402 INFO L225 Difference]: With dead ends: 936 [2019-10-15 01:27:37,402 INFO L226 Difference]: Without dead ends: 498 [2019-10-15 01:27:37,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-15 01:27:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2019-10-15 01:27:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-15 01:27:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2019-10-15 01:27:37,420 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2019-10-15 01:27:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:37,420 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2019-10-15 01:27:37,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2019-10-15 01:27:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:27:37,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:37,423 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-15 01:27:37,423 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2019-10-15 01:27:37,424 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:37,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633181491] [2019-10-15 01:27:37,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:37,482 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-15 01:27:37,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633181491] [2019-10-15 01:27:37,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:37,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:37,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462501083] [2019-10-15 01:27:37,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:37,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:37,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,485 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2019-10-15 01:27:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:37,541 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2019-10-15 01:27:37,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:37,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-15 01:27:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:37,547 INFO L225 Difference]: With dead ends: 972 [2019-10-15 01:27:37,547 INFO L226 Difference]: Without dead ends: 731 [2019-10-15 01:27:37,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-15 01:27:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-15 01:27:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-15 01:27:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2019-10-15 01:27:37,573 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2019-10-15 01:27:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:37,573 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2019-10-15 01:27:37,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2019-10-15 01:27:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:27:37,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:37,577 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-15 01:27:37,577 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:37,578 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2019-10-15 01:27:37,578 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:37,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358947673] [2019-10-15 01:27:37,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:37,647 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-15 01:27:37,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358947673] [2019-10-15 01:27:37,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:37,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:37,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673006430] [2019-10-15 01:27:37,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:37,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:37,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,653 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2019-10-15 01:27:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:37,696 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2019-10-15 01:27:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:37,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-15 01:27:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:37,702 INFO L225 Difference]: With dead ends: 972 [2019-10-15 01:27:37,703 INFO L226 Difference]: Without dead ends: 970 [2019-10-15 01:27:37,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-15 01:27:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-10-15 01:27:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-15 01:27:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2019-10-15 01:27:37,732 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2019-10-15 01:27:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:37,733 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2019-10-15 01:27:37,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2019-10-15 01:27:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 01:27:37,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:37,736 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:37,736 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2019-10-15 01:27:37,737 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:37,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880448713] [2019-10-15 01:27:37,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-15 01:27:37,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880448713] [2019-10-15 01:27:37,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:37,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:37,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622037223] [2019-10-15 01:27:37,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:37,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,789 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2019-10-15 01:27:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:37,923 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2019-10-15 01:27:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:37,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-15 01:27:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:37,930 INFO L225 Difference]: With dead ends: 2034 [2019-10-15 01:27:37,930 INFO L226 Difference]: Without dead ends: 1076 [2019-10-15 01:27:37,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-10-15 01:27:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2019-10-15 01:27:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-15 01:27:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2019-10-15 01:27:37,963 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2019-10-15 01:27:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:37,963 INFO L462 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2019-10-15 01:27:37,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2019-10-15 01:27:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:27:37,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:37,967 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:37,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2019-10-15 01:27:37,968 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:37,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408901174] [2019-10-15 01:27:37,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:37,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-15 01:27:38,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408901174] [2019-10-15 01:27:38,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:38,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:38,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180722565] [2019-10-15 01:27:38,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:38,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:38,045 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2019-10-15 01:27:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:38,248 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2019-10-15 01:27:38,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:38,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-15 01:27:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:38,255 INFO L225 Difference]: With dead ends: 2316 [2019-10-15 01:27:38,256 INFO L226 Difference]: Without dead ends: 1258 [2019-10-15 01:27:38,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-15 01:27:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2019-10-15 01:27:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-15 01:27:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2019-10-15 01:27:38,300 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2019-10-15 01:27:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:38,301 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2019-10-15 01:27:38,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2019-10-15 01:27:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-15 01:27:38,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:38,306 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:38,307 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:38,307 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2019-10-15 01:27:38,307 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:38,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509567896] [2019-10-15 01:27:38,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:38,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:38,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-15 01:27:38,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509567896] [2019-10-15 01:27:38,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:38,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:38,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786189883] [2019-10-15 01:27:38,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:38,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:38,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:38,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:38,383 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2019-10-15 01:27:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:38,551 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2019-10-15 01:27:38,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:38,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-15 01:27:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:38,561 INFO L225 Difference]: With dead ends: 2544 [2019-10-15 01:27:38,561 INFO L226 Difference]: Without dead ends: 1338 [2019-10-15 01:27:38,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:38,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-10-15 01:27:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2019-10-15 01:27:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-15 01:27:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2019-10-15 01:27:38,617 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2019-10-15 01:27:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:38,618 INFO L462 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2019-10-15 01:27:38,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2019-10-15 01:27:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-15 01:27:38,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:38,624 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:38,624 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:38,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:38,625 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2019-10-15 01:27:38,625 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:38,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094097327] [2019-10-15 01:27:38,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:38,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:38,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-15 01:27:38,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094097327] [2019-10-15 01:27:38,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:38,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:38,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739667570] [2019-10-15 01:27:38,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:38,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:38,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:38,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:38,754 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2019-10-15 01:27:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:38,900 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2019-10-15 01:27:38,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:38,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-15 01:27:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:38,908 INFO L225 Difference]: With dead ends: 2784 [2019-10-15 01:27:38,909 INFO L226 Difference]: Without dead ends: 1466 [2019-10-15 01:27:38,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-15 01:27:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2019-10-15 01:27:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-15 01:27:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2019-10-15 01:27:38,956 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2019-10-15 01:27:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:38,957 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2019-10-15 01:27:38,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2019-10-15 01:27:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-15 01:27:38,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:38,963 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:38,963 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:38,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:38,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2019-10-15 01:27:38,964 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:38,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752899987] [2019-10-15 01:27:38,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:38,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:38,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-15 01:27:39,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752899987] [2019-10-15 01:27:39,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:39,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:39,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699407697] [2019-10-15 01:27:39,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:39,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:39,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:39,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,059 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2019-10-15 01:27:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:39,137 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2019-10-15 01:27:39,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:39,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-15 01:27:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:39,152 INFO L225 Difference]: With dead ends: 4334 [2019-10-15 01:27:39,152 INFO L226 Difference]: Without dead ends: 2892 [2019-10-15 01:27:39,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-10-15 01:27:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2019-10-15 01:27:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-10-15 01:27:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2019-10-15 01:27:39,240 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2019-10-15 01:27:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:39,241 INFO L462 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2019-10-15 01:27:39,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2019-10-15 01:27:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-15 01:27:39,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:39,250 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:39,250 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2019-10-15 01:27:39,251 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:39,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794907052] [2019-10-15 01:27:39,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-15 01:27:39,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794907052] [2019-10-15 01:27:39,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:39,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:39,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531134710] [2019-10-15 01:27:39,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:39,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,350 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2019-10-15 01:27:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:39,548 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2019-10-15 01:27:39,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:39,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-15 01:27:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:39,565 INFO L225 Difference]: With dead ends: 6068 [2019-10-15 01:27:39,565 INFO L226 Difference]: Without dead ends: 3190 [2019-10-15 01:27:39,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2019-10-15 01:27:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2019-10-15 01:27:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-15 01:27:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2019-10-15 01:27:39,661 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2019-10-15 01:27:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:39,662 INFO L462 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2019-10-15 01:27:39,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2019-10-15 01:27:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-15 01:27:39,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:39,670 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:39,671 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:39,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:39,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2019-10-15 01:27:39,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:39,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751490088] [2019-10-15 01:27:39,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:39,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-10-15 01:27:39,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751490088] [2019-10-15 01:27:39,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:39,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:39,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751751103] [2019-10-15 01:27:39,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:39,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:39,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:39,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:39,811 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2019-10-15 01:27:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:39,980 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2019-10-15 01:27:39,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:39,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-15 01:27:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:39,997 INFO L225 Difference]: With dead ends: 6484 [2019-10-15 01:27:39,997 INFO L226 Difference]: Without dead ends: 3322 [2019-10-15 01:27:40,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2019-10-15 01:27:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2019-10-15 01:27:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-10-15 01:27:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2019-10-15 01:27:40,095 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2019-10-15 01:27:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,096 INFO L462 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2019-10-15 01:27:40,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2019-10-15 01:27:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-15 01:27:40,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,106 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:40,106 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2019-10-15 01:27:40,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871443784] [2019-10-15 01:27:40,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-15 01:27:40,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871443784] [2019-10-15 01:27:40,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109652210] [2019-10-15 01:27:40,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,258 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2019-10-15 01:27:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:40,549 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2019-10-15 01:27:40,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:40,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-10-15 01:27:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:40,570 INFO L225 Difference]: With dead ends: 7000 [2019-10-15 01:27:40,571 INFO L226 Difference]: Without dead ends: 3706 [2019-10-15 01:27:40,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-10-15 01:27:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2019-10-15 01:27:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-10-15 01:27:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2019-10-15 01:27:40,717 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2019-10-15 01:27:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,718 INFO L462 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2019-10-15 01:27:40,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2019-10-15 01:27:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-15 01:27:40,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,734 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:40,735 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2019-10-15 01:27:40,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734353983] [2019-10-15 01:27:40,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-15 01:27:40,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734353983] [2019-10-15 01:27:40,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937755936] [2019-10-15 01:27:40,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,897 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2019-10-15 01:27:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,184 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2019-10-15 01:27:41,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-10-15 01:27:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,209 INFO L225 Difference]: With dead ends: 7632 [2019-10-15 01:27:41,209 INFO L226 Difference]: Without dead ends: 4026 [2019-10-15 01:27:41,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-10-15 01:27:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2019-10-15 01:27:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-10-15 01:27:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2019-10-15 01:27:41,376 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2019-10-15 01:27:41,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,377 INFO L462 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2019-10-15 01:27:41,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2019-10-15 01:27:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-15 01:27:41,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,395 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,395 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2019-10-15 01:27:41,396 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881420502] [2019-10-15 01:27:41,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-15 01:27:41,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881420502] [2019-10-15 01:27:41,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423157540] [2019-10-15 01:27:41,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,621 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2019-10-15 01:27:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,718 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2019-10-15 01:27:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-15 01:27:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,738 INFO L225 Difference]: With dead ends: 10686 [2019-10-15 01:27:41,738 INFO L226 Difference]: Without dead ends: 6960 [2019-10-15 01:27:41,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2019-10-15 01:27:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2019-10-15 01:27:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2019-10-15 01:27:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2019-10-15 01:27:41,935 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2019-10-15 01:27:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,936 INFO L462 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2019-10-15 01:27:41,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2019-10-15 01:27:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-15 01:27:41,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,953 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,954 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2019-10-15 01:27:41,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277475866] [2019-10-15 01:27:41,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-10-15 01:27:42,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277475866] [2019-10-15 01:27:42,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375178507] [2019-10-15 01:27:42,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,153 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2019-10-15 01:27:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,372 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2019-10-15 01:27:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-15 01:27:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,391 INFO L225 Difference]: With dead ends: 13912 [2019-10-15 01:27:42,391 INFO L226 Difference]: Without dead ends: 6966 [2019-10-15 01:27:42,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-10-15 01:27:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2019-10-15 01:27:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-10-15 01:27:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2019-10-15 01:27:42,562 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2019-10-15 01:27:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,563 INFO L462 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2019-10-15 01:27:42,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2019-10-15 01:27:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-15 01:27:42,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,579 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,579 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2019-10-15 01:27:42,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899239857] [2019-10-15 01:27:42,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-15 01:27:42,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899239857] [2019-10-15 01:27:42,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762619437] [2019-10-15 01:27:42,712 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-15 01:27:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:27:42,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-10-15 01:27:43,022 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-10-15 01:27:43,104 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:43,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2019-10-15 01:27:43,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891183559] [2019-10-15 01:27:43,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:43,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:43,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:27:43,107 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 6 states. [2019-10-15 01:27:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,651 INFO L93 Difference]: Finished difference Result 14738 states and 19579 transitions. [2019-10-15 01:27:43,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:43,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-10-15 01:27:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,677 INFO L225 Difference]: With dead ends: 14738 [2019-10-15 01:27:43,678 INFO L226 Difference]: Without dead ends: 7756 [2019-10-15 01:27:43,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:27:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7756 states. [2019-10-15 01:27:43,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7756 to 7556. [2019-10-15 01:27:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7556 states. [2019-10-15 01:27:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7556 states to 7556 states and 10149 transitions. [2019-10-15 01:27:44,018 INFO L78 Accepts]: Start accepts. Automaton has 7556 states and 10149 transitions. Word has length 284 [2019-10-15 01:27:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,019 INFO L462 AbstractCegarLoop]: Abstraction has 7556 states and 10149 transitions. [2019-10-15 01:27:44,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 7556 states and 10149 transitions. [2019-10-15 01:27:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-15 01:27:44,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,044 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:44,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:44,251 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash -39333344, now seen corresponding path program 1 times [2019-10-15 01:27:44,252 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080793558] [2019-10-15 01:27:44,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-15 01:27:44,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080793558] [2019-10-15 01:27:44,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134849795] [2019-10-15 01:27:44,527 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-15 01:27:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:44,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-15 01:27:44,814 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-15 01:27:44,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2111156015] [2019-10-15 01:27:44,904 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 298 [2019-10-15 01:27:44,977 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:44,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:47,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:47,608 INFO L272 AbstractInterpreter]: Visited 107 different actions 2019 times. Merged at 95 different actions 1657 times. Widened at 21 different actions 222 times. Performed 5166 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 234 fixpoints after 29 different actions. Largest state had 104 variables. [2019-10-15 01:27:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:47,618 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:47,619 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:47,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:47,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867870467] [2019-10-15 01:27:47,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:47,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:47,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:47,622 INFO L87 Difference]: Start difference. First operand 7556 states and 10149 transitions. Second operand 6 states. [2019-10-15 01:27:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:48,700 INFO L93 Difference]: Finished difference Result 18968 states and 25437 transitions. [2019-10-15 01:27:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:27:48,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 297 [2019-10-15 01:27:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:48,738 INFO L225 Difference]: With dead ends: 18968 [2019-10-15 01:27:48,739 INFO L226 Difference]: Without dead ends: 11422 [2019-10-15 01:27:48,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:27:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11422 states. [2019-10-15 01:27:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11422 to 9772. [2019-10-15 01:27:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9772 states. [2019-10-15 01:27:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9772 states to 9772 states and 12991 transitions. [2019-10-15 01:27:49,240 INFO L78 Accepts]: Start accepts. Automaton has 9772 states and 12991 transitions. Word has length 297 [2019-10-15 01:27:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:49,242 INFO L462 AbstractCegarLoop]: Abstraction has 9772 states and 12991 transitions. [2019-10-15 01:27:49,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 9772 states and 12991 transitions. [2019-10-15 01:27:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-15 01:27:49,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:49,275 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:49,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:49,490 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 2 times [2019-10-15 01:27:49,491 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:49,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675064431] [2019-10-15 01:27:49,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-15 01:27:49,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675064431] [2019-10-15 01:27:49,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123776029] [2019-10-15 01:27:49,647 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-15 01:27:49,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:27:49,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:27:49,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:49,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-10-15 01:27:49,826 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-10-15 01:27:49,881 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:49,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:27:49,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457891292] [2019-10-15 01:27:49,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:49,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:49,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:49,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:49,884 INFO L87 Difference]: Start difference. First operand 9772 states and 12991 transitions. Second operand 3 states. [2019-10-15 01:27:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:50,189 INFO L93 Difference]: Finished difference Result 18998 states and 24870 transitions. [2019-10-15 01:27:50,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:50,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-10-15 01:27:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:50,211 INFO L225 Difference]: With dead ends: 18998 [2019-10-15 01:27:50,211 INFO L226 Difference]: Without dead ends: 9244 [2019-10-15 01:27:50,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 620 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-15 01:27:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9244 states. [2019-10-15 01:27:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9244 to 9196. [2019-10-15 01:27:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9196 states. [2019-10-15 01:27:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9196 states to 9196 states and 11815 transitions. [2019-10-15 01:27:50,518 INFO L78 Accepts]: Start accepts. Automaton has 9196 states and 11815 transitions. Word has length 310 [2019-10-15 01:27:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:50,518 INFO L462 AbstractCegarLoop]: Abstraction has 9196 states and 11815 transitions. [2019-10-15 01:27:50,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 9196 states and 11815 transitions. [2019-10-15 01:27:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-15 01:27:50,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:50,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:27:50,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:50,751 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash 670685447, now seen corresponding path program 1 times [2019-10-15 01:27:50,752 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:50,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682827483] [2019-10-15 01:27:50,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:51,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682827483] [2019-10-15 01:27:51,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569784394] [2019-10-15 01:27:51,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:51,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:51,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-10-15 01:27:51,467 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-10-15 01:27:51,817 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:51,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:27:51,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305390143] [2019-10-15 01:27:51,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:51,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:51,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:51,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:51,820 INFO L87 Difference]: Start difference. First operand 9196 states and 11815 transitions. Second operand 3 states. [2019-10-15 01:27:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:52,068 INFO L93 Difference]: Finished difference Result 22938 states and 29452 transitions. [2019-10-15 01:27:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:52,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-10-15 01:27:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:52,111 INFO L225 Difference]: With dead ends: 22938 [2019-10-15 01:27:52,111 INFO L226 Difference]: Without dead ends: 13760 [2019-10-15 01:27:52,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 754 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-15 01:27:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13760 states. [2019-10-15 01:27:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13760 to 13760. [2019-10-15 01:27:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13760 states. [2019-10-15 01:27:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13760 states to 13760 states and 17637 transitions. [2019-10-15 01:27:52,537 INFO L78 Accepts]: Start accepts. Automaton has 13760 states and 17637 transitions. Word has length 377 [2019-10-15 01:27:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:52,538 INFO L462 AbstractCegarLoop]: Abstraction has 13760 states and 17637 transitions. [2019-10-15 01:27:52,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 13760 states and 17637 transitions. [2019-10-15 01:27:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-15 01:27:52,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:52,571 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:27:52,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:52,785 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2068327023, now seen corresponding path program 1 times [2019-10-15 01:27:52,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:52,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031188569] [2019-10-15 01:27:52,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:52,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:52,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:53,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031188569] [2019-10-15 01:27:53,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934780624] [2019-10-15 01:27:53,029 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-15 01:27:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:53,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:53,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:53,490 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:53,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1178858289] [2019-10-15 01:27:53,596 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 380 [2019-10-15 01:27:53,606 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:53,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:56,228 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:56,229 INFO L272 AbstractInterpreter]: Visited 111 different actions 2233 times. Merged at 99 different actions 1786 times. Widened at 20 different actions 218 times. Performed 5704 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5704 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 321 fixpoints after 44 different actions. Largest state had 104 variables. [2019-10-15 01:27:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,230 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:56,230 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:56,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:56,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867022918] [2019-10-15 01:27:56,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:56,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:56,235 INFO L87 Difference]: Start difference. First operand 13760 states and 17637 transitions. Second operand 6 states. [2019-10-15 01:27:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,809 INFO L93 Difference]: Finished difference Result 30926 states and 39483 transitions. [2019-10-15 01:27:56,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:56,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 379 [2019-10-15 01:27:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,843 INFO L225 Difference]: With dead ends: 30926 [2019-10-15 01:27:56,843 INFO L226 Difference]: Without dead ends: 17172 [2019-10-15 01:27:56,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:27:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17172 states. [2019-10-15 01:27:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17172 to 15096. [2019-10-15 01:27:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15096 states. [2019-10-15 01:27:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15096 states to 15096 states and 19337 transitions. [2019-10-15 01:27:57,152 INFO L78 Accepts]: Start accepts. Automaton has 15096 states and 19337 transitions. Word has length 379 [2019-10-15 01:27:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,153 INFO L462 AbstractCegarLoop]: Abstraction has 15096 states and 19337 transitions. [2019-10-15 01:27:57,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 15096 states and 19337 transitions. [2019-10-15 01:27:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-15 01:27:57,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:57,184 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:27:57,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:57,390 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:57,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:57,390 INFO L82 PathProgramCache]: Analyzing trace with hash -725462501, now seen corresponding path program 1 times [2019-10-15 01:27:57,391 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:57,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117434214] [2019-10-15 01:27:57,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-15 01:27:57,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117434214] [2019-10-15 01:27:57,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:57,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:57,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888224647] [2019-10-15 01:27:57,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:57,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:57,581 INFO L87 Difference]: Start difference. First operand 15096 states and 19337 transitions. Second operand 3 states. [2019-10-15 01:27:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:57,859 INFO L93 Difference]: Finished difference Result 27089 states and 34072 transitions. [2019-10-15 01:27:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:57,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-15 01:27:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:57,871 INFO L225 Difference]: With dead ends: 27089 [2019-10-15 01:27:57,872 INFO L226 Difference]: Without dead ends: 5655 [2019-10-15 01:27:57,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5655 states. [2019-10-15 01:27:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5655 to 5398. [2019-10-15 01:27:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5398 states. [2019-10-15 01:27:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 6798 transitions. [2019-10-15 01:27:57,985 INFO L78 Accepts]: Start accepts. Automaton has 5398 states and 6798 transitions. Word has length 418 [2019-10-15 01:27:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,985 INFO L462 AbstractCegarLoop]: Abstraction has 5398 states and 6798 transitions. [2019-10-15 01:27:57,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5398 states and 6798 transitions. [2019-10-15 01:27:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-15 01:27:58,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:58,001 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:58,001 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2019-10-15 01:27:58,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:58,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464853092] [2019-10-15 01:27:58,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-15 01:27:58,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464853092] [2019-10-15 01:27:58,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765299731] [2019-10-15 01:27:58,306 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-15 01:27:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:58,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:58,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-15 01:27:58,559 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-15 01:27:58,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [29097320] [2019-10-15 01:27:58,679 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 448 [2019-10-15 01:27:58,682 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:58,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:00,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:00,579 INFO L272 AbstractInterpreter]: Visited 113 different actions 1875 times. Merged at 99 different actions 1527 times. Widened at 18 different actions 203 times. Performed 4987 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4987 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 230 fixpoints after 33 different actions. Largest state had 105 variables. [2019-10-15 01:28:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,580 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:00,580 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:00,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:00,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973979640] [2019-10-15 01:28:00,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:00,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:00,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:00,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:00,583 INFO L87 Difference]: Start difference. First operand 5398 states and 6798 transitions. Second operand 6 states. [2019-10-15 01:28:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:00,840 INFO L93 Difference]: Finished difference Result 5903 states and 7434 transitions. [2019-10-15 01:28:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:00,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 447 [2019-10-15 01:28:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:00,841 INFO L225 Difference]: With dead ends: 5903 [2019-10-15 01:28:00,841 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:00,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 895 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:00,851 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2019-10-15 01:28:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:00,851 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:00,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:00,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:01,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:01,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:02,127 WARN L191 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 89 [2019-10-15 01:28:02,814 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27