/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:13:16,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:13:16,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:13:16,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:13:16,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:13:16,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:13:16,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:13:16,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:13:16,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:13:16,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:13:16,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:13:16,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:13:16,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:13:16,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:13:16,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:13:16,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:13:16,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:13:16,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:13:16,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:13:16,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:13:16,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:13:16,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:13:16,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:13:16,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:13:16,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:13:16,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:13:16,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:13:16,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:13:16,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:13:16,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:13:16,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:13:16,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:13:16,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:13:16,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:13:16,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:13:16,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:13:16,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:13:16,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:13:16,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:13:16,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:13:16,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:13:16,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:13:16,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:13:16,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:13:16,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:13:16,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:13:16,311 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:13:16,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:13:16,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:13:16,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:13:16,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:13:16,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:13:16,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:13:16,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:13:16,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:13:16,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:13:16,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:13:16,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:13:16,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:13:16,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:13:16,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:13:16,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:13:16,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:13:16,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:13:16,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:13:16,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:13:16,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:13:16,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:13:16,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:13:16,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:13:16,316 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-11-07 01:13:16,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:13:16,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:13:16,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:13:16,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:13:16,678 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:13:16,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-07 01:13:16,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45907c47d/56cfe691f35f49b0a75d0cba3cf42802/FLAGa39f471a9 [2019-11-07 01:13:17,316 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:13:17,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_2.cil-2.c [2019-11-07 01:13:17,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45907c47d/56cfe691f35f49b0a75d0cba3cf42802/FLAGa39f471a9 [2019-11-07 01:13:17,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45907c47d/56cfe691f35f49b0a75d0cba3cf42802 [2019-11-07 01:13:17,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:13:17,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:13:17,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:17,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:13:17,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:13:17,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:17" (1/1) ... [2019-11-07 01:13:17,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758afb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:17, skipping insertion in model container [2019-11-07 01:13:17,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:17" (1/1) ... [2019-11-07 01:13:17,594 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:13:17,655 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:13:17,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:17,918 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:13:18,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:18,110 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:13:18,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18 WrapperNode [2019-11-07 01:13:18,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:18,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:13:18,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:13:18,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:13:18,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (1/1) ... [2019-11-07 01:13:18,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (1/1) ... [2019-11-07 01:13:18,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (1/1) ... [2019-11-07 01:13:18,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (1/1) ... [2019-11-07 01:13:18,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (1/1) ... [2019-11-07 01:13:18,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (1/1) ... [2019-11-07 01:13:18,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (1/1) ... [2019-11-07 01:13:18,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:13:18,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:13:18,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:13:18,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:13:18,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:13:18,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:13:18,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:13:18,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-11-07 01:13:18,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:13:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:13:18,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:13:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:13:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 01:13:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 01:13:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-11-07 01:13:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:13:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:13:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:13:18,445 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 01:13:18,948 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-07 01:13:18,949 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-07 01:13:18,963 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:13:18,964 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:13:18,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:18 BoogieIcfgContainer [2019-11-07 01:13:18,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:13:18,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:13:18,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:13:18,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:13:18,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:13:17" (1/3) ... [2019-11-07 01:13:18,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd9c6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:18, skipping insertion in model container [2019-11-07 01:13:18,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:18" (2/3) ... [2019-11-07 01:13:18,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd9c6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:18, skipping insertion in model container [2019-11-07 01:13:18,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:18" (3/3) ... [2019-11-07 01:13:18,976 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2019-11-07 01:13:18,987 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:13:18,997 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:13:19,011 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:13:19,040 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:13:19,041 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:13:19,041 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:13:19,041 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:13:19,042 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:13:19,042 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:13:19,042 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:13:19,042 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:13:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-11-07 01:13:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 01:13:19,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:19,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:19,079 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:19,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-11-07 01:13:19,096 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:19,097 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291646725] [2019-11-07 01:13:19,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:19,350 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291646725] [2019-11-07 01:13:19,350 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:19,351 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:19,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772415568] [2019-11-07 01:13:19,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:19,360 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:19,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:19,378 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-11-07 01:13:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:19,492 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-11-07 01:13:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:19,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 01:13:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:19,509 INFO L225 Difference]: With dead ends: 377 [2019-11-07 01:13:19,510 INFO L226 Difference]: Without dead ends: 220 [2019-11-07 01:13:19,514 INFO L630 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-11-07 01:13:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-07 01:13:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-07 01:13:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:13:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-11-07 01:13:19,586 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-11-07 01:13:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:19,586 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-11-07 01:13:19,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-11-07 01:13:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 01:13:19,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:19,590 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:19,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:19,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2019-11-07 01:13:19,592 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:19,592 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588176856] [2019-11-07 01:13:19,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:13:19,685 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588176856] [2019-11-07 01:13:19,685 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:19,685 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:19,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053480206] [2019-11-07 01:13:19,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:19,689 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:19,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:19,690 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-11-07 01:13:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:19,920 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-11-07 01:13:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:19,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-07 01:13:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:19,924 INFO L225 Difference]: With dead ends: 470 [2019-11-07 01:13:19,925 INFO L226 Difference]: Without dead ends: 262 [2019-11-07 01:13:19,927 INFO L630 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-11-07 01:13:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-07 01:13:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-11-07 01:13:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-07 01:13:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-11-07 01:13:19,973 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-11-07 01:13:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:19,973 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-11-07 01:13:19,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-11-07 01:13:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:13:19,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:19,978 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:19,978 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2019-11-07 01:13:19,979 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:19,979 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641199394] [2019-11-07 01:13:19,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:13:20,095 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641199394] [2019-11-07 01:13:20,096 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:20,096 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:20,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102793602] [2019-11-07 01:13:20,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:20,097 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:20,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:20,098 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-11-07 01:13:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:20,331 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-11-07 01:13:20,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:20,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:13:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:20,334 INFO L225 Difference]: With dead ends: 598 [2019-11-07 01:13:20,335 INFO L226 Difference]: Without dead ends: 354 [2019-11-07 01:13:20,337 INFO L630 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-11-07 01:13:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-07 01:13:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-11-07 01:13:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-07 01:13:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-11-07 01:13:20,356 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-11-07 01:13:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:20,357 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-11-07 01:13:20,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-11-07 01:13:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:13:20,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:20,361 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:20,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:20,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2019-11-07 01:13:20,362 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:20,362 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635323123] [2019-11-07 01:13:20,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:13:20,465 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635323123] [2019-11-07 01:13:20,465 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:20,466 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:20,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530643637] [2019-11-07 01:13:20,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:20,467 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:20,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:20,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:20,467 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-11-07 01:13:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:20,644 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-11-07 01:13:20,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:20,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:13:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:20,648 INFO L225 Difference]: With dead ends: 708 [2019-11-07 01:13:20,648 INFO L226 Difference]: Without dead ends: 384 [2019-11-07 01:13:20,650 INFO L630 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-11-07 01:13:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-07 01:13:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-11-07 01:13:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-07 01:13:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-11-07 01:13:20,667 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-11-07 01:13:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:20,667 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-11-07 01:13:20,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-11-07 01:13:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-07 01:13:20,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:20,672 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:20,673 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2019-11-07 01:13:20,673 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:20,674 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286621566] [2019-11-07 01:13:20,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:13:20,741 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286621566] [2019-11-07 01:13:20,741 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:20,741 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:20,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622029350] [2019-11-07 01:13:20,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:20,744 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:20,745 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-11-07 01:13:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:20,985 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-11-07 01:13:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:20,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-07 01:13:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:20,990 INFO L225 Difference]: With dead ends: 842 [2019-11-07 01:13:20,990 INFO L226 Difference]: Without dead ends: 478 [2019-11-07 01:13:20,992 INFO L630 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-11-07 01:13:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-07 01:13:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-11-07 01:13:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-07 01:13:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-11-07 01:13:21,016 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-11-07 01:13:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,016 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-11-07 01:13:21,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-11-07 01:13:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-07 01:13:21,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,022 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,022 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2019-11-07 01:13:21,022 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,023 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072509575] [2019-11-07 01:13:21,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-07 01:13:21,106 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072509575] [2019-11-07 01:13:21,106 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:21,107 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:21,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572218819] [2019-11-07 01:13:21,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:21,108 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:21,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:21,108 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-11-07 01:13:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:21,249 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-11-07 01:13:21,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:21,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-07 01:13:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:21,254 INFO L225 Difference]: With dead ends: 940 [2019-11-07 01:13:21,254 INFO L226 Difference]: Without dead ends: 500 [2019-11-07 01:13:21,255 INFO L630 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-11-07 01:13:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-07 01:13:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-11-07 01:13:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-07 01:13:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-11-07 01:13:21,275 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-11-07 01:13:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,277 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-11-07 01:13:21,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-11-07 01:13:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-07 01:13:21,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,285 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,285 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2019-11-07 01:13:21,287 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,287 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082564232] [2019-11-07 01:13:21,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 01:13:21,377 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082564232] [2019-11-07 01:13:21,377 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:21,378 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:21,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084037337] [2019-11-07 01:13:21,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:21,379 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:21,380 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-11-07 01:13:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:21,421 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-11-07 01:13:21,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:21,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-07 01:13:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:21,426 INFO L225 Difference]: With dead ends: 976 [2019-11-07 01:13:21,426 INFO L226 Difference]: Without dead ends: 734 [2019-11-07 01:13:21,429 INFO L630 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-11-07 01:13:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-11-07 01:13:21,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-11-07 01:13:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-11-07 01:13:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-11-07 01:13:21,451 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-11-07 01:13:21,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,451 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-11-07 01:13:21,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-11-07 01:13:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-07 01:13:21,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,459 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,459 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2019-11-07 01:13:21,460 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,460 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624884614] [2019-11-07 01:13:21,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-07 01:13:21,543 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624884614] [2019-11-07 01:13:21,543 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:21,543 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:21,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151794514] [2019-11-07 01:13:21,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:21,544 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:21,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:21,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:21,545 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-11-07 01:13:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:21,600 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-11-07 01:13:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:21,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-07 01:13:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:21,606 INFO L225 Difference]: With dead ends: 976 [2019-11-07 01:13:21,607 INFO L226 Difference]: Without dead ends: 974 [2019-11-07 01:13:21,608 INFO L630 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-11-07 01:13:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-07 01:13:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-11-07 01:13:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-07 01:13:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-11-07 01:13:21,636 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-11-07 01:13:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,637 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-11-07 01:13:21,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-11-07 01:13:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-07 01:13:21,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,641 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,641 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,642 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2019-11-07 01:13:21,642 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,642 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042842902] [2019-11-07 01:13:21,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-07 01:13:21,699 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042842902] [2019-11-07 01:13:21,699 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:21,700 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:21,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191001653] [2019-11-07 01:13:21,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:21,701 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:21,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:21,703 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-11-07 01:13:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:21,890 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-11-07 01:13:21,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:21,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-07 01:13:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:21,898 INFO L225 Difference]: With dead ends: 2140 [2019-11-07 01:13:21,898 INFO L226 Difference]: Without dead ends: 1170 [2019-11-07 01:13:21,901 INFO L630 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-11-07 01:13:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-11-07 01:13:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-11-07 01:13:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-11-07 01:13:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-11-07 01:13:21,937 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2019-11-07 01:13:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,938 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-11-07 01:13:21,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-11-07 01:13:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-07 01:13:21,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,943 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,943 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2019-11-07 01:13:21,943 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,944 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133967553] [2019-11-07 01:13:21,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-07 01:13:22,032 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133967553] [2019-11-07 01:13:22,032 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:22,033 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:22,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280708299] [2019-11-07 01:13:22,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:22,033 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:22,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:22,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:22,034 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-11-07 01:13:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:22,166 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-11-07 01:13:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:22,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-07 01:13:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:22,173 INFO L225 Difference]: With dead ends: 2354 [2019-11-07 01:13:22,176 INFO L226 Difference]: Without dead ends: 1236 [2019-11-07 01:13:22,185 INFO L630 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-11-07 01:13:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-11-07 01:13:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-11-07 01:13:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-11-07 01:13:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-11-07 01:13:22,230 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2019-11-07 01:13:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:22,230 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-11-07 01:13:22,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-11-07 01:13:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-07 01:13:22,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:22,240 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:22,240 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2019-11-07 01:13:22,241 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:22,242 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001279096] [2019-11-07 01:13:22,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-07 01:13:22,383 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001279096] [2019-11-07 01:13:22,383 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:22,384 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:22,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524747933] [2019-11-07 01:13:22,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:22,385 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:22,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:22,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:22,386 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-11-07 01:13:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:22,607 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-11-07 01:13:22,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:22,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-07 01:13:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:22,619 INFO L225 Difference]: With dead ends: 2544 [2019-11-07 01:13:22,646 INFO L226 Difference]: Without dead ends: 1334 [2019-11-07 01:13:22,648 INFO L630 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-11-07 01:13:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-11-07 01:13:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-11-07 01:13:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-11-07 01:13:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-11-07 01:13:22,685 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2019-11-07 01:13:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:22,686 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-11-07 01:13:22,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-11-07 01:13:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-07 01:13:22,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:22,692 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:22,692 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:22,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:22,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2019-11-07 01:13:22,693 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:22,693 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425452634] [2019-11-07 01:13:22,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-07 01:13:22,783 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425452634] [2019-11-07 01:13:22,783 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:22,784 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:22,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061413034] [2019-11-07 01:13:22,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:22,785 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:22,785 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-11-07 01:13:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:22,938 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-11-07 01:13:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:22,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-11-07 01:13:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:22,945 INFO L225 Difference]: With dead ends: 2752 [2019-11-07 01:13:22,946 INFO L226 Difference]: Without dead ends: 1442 [2019-11-07 01:13:22,949 INFO L630 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-11-07 01:13:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-11-07 01:13:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-11-07 01:13:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-11-07 01:13:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-11-07 01:13:22,993 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2019-11-07 01:13:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:22,993 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-11-07 01:13:22,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-11-07 01:13:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-07 01:13:23,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:23,002 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:23,002 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2019-11-07 01:13:23,003 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:23,003 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792469123] [2019-11-07 01:13:23,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-07 01:13:23,150 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792469123] [2019-11-07 01:13:23,150 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:23,150 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:23,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163776383] [2019-11-07 01:13:23,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:23,152 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:23,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:23,152 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-11-07 01:13:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:23,320 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-11-07 01:13:23,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:23,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-11-07 01:13:23,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:23,332 INFO L225 Difference]: With dead ends: 2992 [2019-11-07 01:13:23,332 INFO L226 Difference]: Without dead ends: 1570 [2019-11-07 01:13:23,337 INFO L630 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-11-07 01:13:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-11-07 01:13:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-11-07 01:13:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-07 01:13:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-11-07 01:13:23,394 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2019-11-07 01:13:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:23,394 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-11-07 01:13:23,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-11-07 01:13:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-07 01:13:23,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:23,407 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:23,407 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2019-11-07 01:13:23,409 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:23,409 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932273989] [2019-11-07 01:13:23,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-11-07 01:13:23,579 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932273989] [2019-11-07 01:13:23,580 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:23,580 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:23,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893998056] [2019-11-07 01:13:23,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:23,582 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:23,583 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-11-07 01:13:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:23,682 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-11-07 01:13:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:23,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-11-07 01:13:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:23,704 INFO L225 Difference]: With dead ends: 4646 [2019-11-07 01:13:23,704 INFO L226 Difference]: Without dead ends: 3100 [2019-11-07 01:13:23,711 INFO L630 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-11-07 01:13:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-11-07 01:13:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-11-07 01:13:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-11-07 01:13:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-11-07 01:13:23,797 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2019-11-07 01:13:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:23,798 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-11-07 01:13:23,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-11-07 01:13:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-07 01:13:23,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:23,808 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:23,808 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2019-11-07 01:13:23,809 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:23,809 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337884462] [2019-11-07 01:13:23,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-11-07 01:13:23,915 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337884462] [2019-11-07 01:13:23,915 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:23,916 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:23,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150743300] [2019-11-07 01:13:23,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:23,917 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:23,918 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-11-07 01:13:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:24,098 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-11-07 01:13:24,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:24,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-11-07 01:13:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:24,116 INFO L225 Difference]: With dead ends: 6484 [2019-11-07 01:13:24,116 INFO L226 Difference]: Without dead ends: 3398 [2019-11-07 01:13:24,125 INFO L630 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-11-07 01:13:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-07 01:13:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-11-07 01:13:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-11-07 01:13:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-11-07 01:13:24,245 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2019-11-07 01:13:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:24,246 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-11-07 01:13:24,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-11-07 01:13:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-07 01:13:24,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:24,256 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:24,256 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:24,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2019-11-07 01:13:24,256 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:24,257 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292927949] [2019-11-07 01:13:24,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-11-07 01:13:24,388 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292927949] [2019-11-07 01:13:24,391 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:24,391 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:24,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662998346] [2019-11-07 01:13:24,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:24,392 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:24,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:24,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:24,393 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-11-07 01:13:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:24,573 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-11-07 01:13:24,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:24,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-11-07 01:13:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:24,591 INFO L225 Difference]: With dead ends: 6900 [2019-11-07 01:13:24,591 INFO L226 Difference]: Without dead ends: 3530 [2019-11-07 01:13:24,598 INFO L630 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-11-07 01:13:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-11-07 01:13:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-11-07 01:13:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-11-07 01:13:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-11-07 01:13:24,711 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2019-11-07 01:13:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:24,712 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-11-07 01:13:24,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-11-07 01:13:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-11-07 01:13:24,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:24,725 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:24,725 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:24,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2019-11-07 01:13:24,726 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:24,726 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491433537] [2019-11-07 01:13:24,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-07 01:13:24,938 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491433537] [2019-11-07 01:13:24,938 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:24,938 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:24,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806446846] [2019-11-07 01:13:24,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:24,940 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:24,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:24,940 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-11-07 01:13:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:25,144 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-11-07 01:13:25,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:25,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-11-07 01:13:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:25,165 INFO L225 Difference]: With dead ends: 7416 [2019-11-07 01:13:25,165 INFO L226 Difference]: Without dead ends: 3914 [2019-11-07 01:13:25,173 INFO L630 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-11-07 01:13:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-11-07 01:13:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-11-07 01:13:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-11-07 01:13:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-11-07 01:13:25,270 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2019-11-07 01:13:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:25,271 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-11-07 01:13:25,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-11-07 01:13:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-11-07 01:13:25,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:25,283 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:25,283 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2019-11-07 01:13:25,284 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:25,284 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523338959] [2019-11-07 01:13:25,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-11-07 01:13:25,436 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523338959] [2019-11-07 01:13:25,437 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:25,437 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:25,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139364437] [2019-11-07 01:13:25,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:25,438 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:25,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:25,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:25,438 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-11-07 01:13:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:25,647 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-11-07 01:13:25,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:25,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-11-07 01:13:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:25,683 INFO L225 Difference]: With dead ends: 8048 [2019-11-07 01:13:25,683 INFO L226 Difference]: Without dead ends: 4234 [2019-11-07 01:13:25,691 INFO L630 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-11-07 01:13:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-11-07 01:13:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-11-07 01:13:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-11-07 01:13:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-11-07 01:13:25,806 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2019-11-07 01:13:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:25,807 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-11-07 01:13:25,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-11-07 01:13:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-11-07 01:13:25,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:25,820 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:25,820 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:25,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2019-11-07 01:13:25,821 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:25,821 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637215390] [2019-11-07 01:13:25,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-11-07 01:13:26,028 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637215390] [2019-11-07 01:13:26,029 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:26,029 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:26,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219452915] [2019-11-07 01:13:26,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:26,031 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:26,031 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-11-07 01:13:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:26,124 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-11-07 01:13:26,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:26,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-11-07 01:13:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:26,144 INFO L225 Difference]: With dead ends: 11310 [2019-11-07 01:13:26,144 INFO L226 Difference]: Without dead ends: 7376 [2019-11-07 01:13:26,153 INFO L630 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-11-07 01:13:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-11-07 01:13:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-11-07 01:13:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-11-07 01:13:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-11-07 01:13:26,421 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2019-11-07 01:13:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:26,422 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-11-07 01:13:26,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-11-07 01:13:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-07 01:13:26,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:26,438 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:26,438 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:26,439 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2019-11-07 01:13:26,439 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:26,439 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966067078] [2019-11-07 01:13:26,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-11-07 01:13:26,559 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966067078] [2019-11-07 01:13:26,559 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:26,560 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:26,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292066561] [2019-11-07 01:13:26,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:26,561 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:26,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:26,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:26,561 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-11-07 01:13:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:26,784 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-11-07 01:13:26,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:26,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-11-07 01:13:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:26,801 INFO L225 Difference]: With dead ends: 14744 [2019-11-07 01:13:26,801 INFO L226 Difference]: Without dead ends: 7382 [2019-11-07 01:13:26,815 INFO L630 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-11-07 01:13:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-11-07 01:13:26,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-11-07 01:13:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-11-07 01:13:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-11-07 01:13:26,971 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2019-11-07 01:13:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:26,972 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-11-07 01:13:26,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-11-07 01:13:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-11-07 01:13:26,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:26,989 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:26,990 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:26,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2019-11-07 01:13:26,990 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:26,991 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609408520] [2019-11-07 01:13:26,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-07 01:13:27,217 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609408520] [2019-11-07 01:13:27,218 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99312032] [2019-11-07 01:13:27,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:27,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 01:13:27,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-11-07 01:13:27,540 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-11-07 01:13:27,691 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:27,691 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2019-11-07 01:13:27,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568833128] [2019-11-07 01:13:27,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:13:27,693 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:27,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:13:27,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:13:27,693 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 8 states. [2019-11-07 01:13:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:28,254 INFO L93 Difference]: Finished difference Result 14930 states and 19459 transitions. [2019-11-07 01:13:28,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:13:28,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 353 [2019-11-07 01:13:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:28,269 INFO L225 Difference]: With dead ends: 14930 [2019-11-07 01:13:28,269 INFO L226 Difference]: Without dead ends: 7564 [2019-11-07 01:13:28,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:13:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-11-07 01:13:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7356. [2019-11-07 01:13:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-11-07 01:13:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-11-07 01:13:28,490 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 353 [2019-11-07 01:13:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:28,490 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-11-07 01:13:28,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:13:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-11-07 01:13:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-07 01:13:28,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:28,508 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:28,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:28,714 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1456365214, now seen corresponding path program 1 times [2019-11-07 01:13:28,715 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:28,715 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268646284] [2019-11-07 01:13:28,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-07 01:13:28,869 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268646284] [2019-11-07 01:13:28,869 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545503147] [2019-11-07 01:13:28,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:28,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:29,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-07 01:13:29,183 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-07 01:13:29,279 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [763955298] [2019-11-07 01:13:29,288 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 367 [2019-11-07 01:13:29,337 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:29,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:29,620 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:31,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:31,517 INFO L272 AbstractInterpreter]: Visited 112 different actions 2522 times. Merged at 101 different actions 2022 times. Widened at 22 different actions 240 times. Performed 6461 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6461 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 367 fixpoints after 40 different actions. Largest state had 105 variables. [2019-11-07 01:13:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:31,524 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:31,525 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:31,525 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:31,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099777057] [2019-11-07 01:13:31,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:31,526 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:31,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:31,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:31,527 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 6 states. [2019-11-07 01:13:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:32,167 INFO L93 Difference]: Finished difference Result 14720 states and 19175 transitions. [2019-11-07 01:13:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:13:32,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 366 [2019-11-07 01:13:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:32,194 INFO L225 Difference]: With dead ends: 14720 [2019-11-07 01:13:32,194 INFO L226 Difference]: Without dead ends: 11130 [2019-11-07 01:13:32,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 733 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-11-07 01:13:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11130 states. [2019-11-07 01:13:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11130 to 8460. [2019-11-07 01:13:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-11-07 01:13:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-11-07 01:13:32,397 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 366 [2019-11-07 01:13:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:32,397 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-11-07 01:13:32,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-11-07 01:13:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-07 01:13:32,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:32,416 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:32,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:32,620 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 2 times [2019-11-07 01:13:32,621 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:32,621 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513218489] [2019-11-07 01:13:32,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-07 01:13:33,185 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513218489] [2019-11-07 01:13:33,186 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725192123] [2019-11-07 01:13:33,186 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-11-07 01:13:33,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-07 01:13:33,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:13:33,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:33,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-07 01:13:33,393 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-07 01:13:33,516 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [29089421] [2019-11-07 01:13:33,516 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 01:13:33,517 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 01:13:33,517 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:33,518 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:33,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854119125] [2019-11-07 01:13:33,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:33,519 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:33,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:33,520 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 6 states. [2019-11-07 01:13:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:34,007 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2019-11-07 01:13:34,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:34,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 379 [2019-11-07 01:13:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:34,028 INFO L225 Difference]: With dead ends: 19118 [2019-11-07 01:13:34,028 INFO L226 Difference]: Without dead ends: 10668 [2019-11-07 01:13:34,045 INFO L630 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-11-07 01:13:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2019-11-07 01:13:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2019-11-07 01:13:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-11-07 01:13:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2019-11-07 01:13:34,204 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2019-11-07 01:13:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:34,205 INFO L462 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2019-11-07 01:13:34,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2019-11-07 01:13:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-11-07 01:13:34,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:34,227 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:34,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:34,432 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2019-11-07 01:13:34,432 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:34,433 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593946472] [2019-11-07 01:13:34,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-07 01:13:34,719 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593946472] [2019-11-07 01:13:34,720 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:34,720 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:34,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915585679] [2019-11-07 01:13:34,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:34,721 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:34,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:34,721 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2019-11-07 01:13:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:34,931 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2019-11-07 01:13:34,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:34,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-11-07 01:13:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:34,941 INFO L225 Difference]: With dead ends: 15876 [2019-11-07 01:13:34,942 INFO L226 Difference]: Without dead ends: 3820 [2019-11-07 01:13:34,958 INFO L630 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-11-07 01:13:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2019-11-07 01:13:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2019-11-07 01:13:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2019-11-07 01:13:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2019-11-07 01:13:35,025 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2019-11-07 01:13:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:35,026 INFO L462 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2019-11-07 01:13:35,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2019-11-07 01:13:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-11-07 01:13:35,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:35,046 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:35,046 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:35,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2019-11-07 01:13:35,047 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:35,047 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627564313] [2019-11-07 01:13:35,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-11-07 01:13:35,305 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627564313] [2019-11-07 01:13:35,305 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842414662] [2019-11-07 01:13:35,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:35,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:35,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-11-07 01:13:35,835 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-11-07 01:13:36,199 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:36,200 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:13:36,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554377131] [2019-11-07 01:13:36,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:36,201 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:36,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:36,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:36,202 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 3 states. [2019-11-07 01:13:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:36,254 INFO L93 Difference]: Finished difference Result 4045 states and 5016 transitions. [2019-11-07 01:13:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:36,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 516 [2019-11-07 01:13:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:36,264 INFO L225 Difference]: With dead ends: 4045 [2019-11-07 01:13:36,264 INFO L226 Difference]: Without dead ends: 3968 [2019-11-07 01:13:36,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 1032 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-11-07 01:13:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3535. [2019-11-07 01:13:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2019-11-07 01:13:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4415 transitions. [2019-11-07 01:13:36,331 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 4415 transitions. Word has length 516 [2019-11-07 01:13:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:36,332 INFO L462 AbstractCegarLoop]: Abstraction has 3535 states and 4415 transitions. [2019-11-07 01:13:36,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 4415 transitions. [2019-11-07 01:13:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-11-07 01:13:36,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:36,343 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:36,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:36,548 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:36,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:36,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1541123714, now seen corresponding path program 1 times [2019-11-07 01:13:36,549 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:36,549 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084566721] [2019-11-07 01:13:36,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-07 01:13:36,941 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084566721] [2019-11-07 01:13:36,941 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040640892] [2019-11-07 01:13:36,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:37,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:37,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-07 01:13:37,404 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-07 01:13:37,656 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1392651191] [2019-11-07 01:13:37,657 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 629 [2019-11-07 01:13:37,670 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:37,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:37,711 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:38,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:38,928 INFO L272 AbstractInterpreter]: Visited 116 different actions 2215 times. Merged at 101 different actions 1800 times. Widened at 20 different actions 219 times. Performed 5850 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5850 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 294 fixpoints after 26 different actions. Largest state had 106 variables. [2019-11-07 01:13:38,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:38,929 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:38,929 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:38,929 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:38,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439215219] [2019-11-07 01:13:38,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:38,931 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:38,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:38,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:38,932 INFO L87 Difference]: Start difference. First operand 3535 states and 4415 transitions. Second operand 6 states. [2019-11-07 01:13:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:39,344 INFO L93 Difference]: Finished difference Result 4407 states and 5498 transitions. [2019-11-07 01:13:39,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:39,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 628 [2019-11-07 01:13:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:39,345 INFO L225 Difference]: With dead ends: 4407 [2019-11-07 01:13:39,345 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 01:13:39,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1257 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-11-07 01:13:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 01:13:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 01:13:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 01:13:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 01:13:39,352 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 628 [2019-11-07 01:13:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:39,353 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 01:13:39,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 01:13:39,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 01:13:39,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:39,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 01:13:39,739 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 50 [2019-11-07 01:13:40,740 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 458 DAG size of output: 98 [2019-11-07 01:13:40,898 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2019-11-07 01:13:41,131 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-11-07 01:13:41,451 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 19 [2019-11-07 01:13:41,562 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-11-07 01:13:41,863 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-11-07 01:13:41,990 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-11-07 01:13:42,611 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-07 01:13:42,688 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 01:13:42,688 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:13:42,689 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-11-07 01:13:42,689 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-11-07 01:13:42,689 INFO L446 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-11-07 01:13:42,689 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-11-07 01:13:42,689 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-11-07 01:13:42,689 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-11-07 01:13:42,690 INFO L439 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-11-07 01:13:42,690 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-11-07 01:13:42,690 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-11-07 01:13:42,690 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-11-07 01:13:42,690 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-11-07 01:13:42,690 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-11-07 01:13:42,690 INFO L443 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-11-07 01:13:42,691 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-11-07 01:13:42,691 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-11-07 01:13:42,691 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-11-07 01:13:42,691 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:42,691 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-11-07 01:13:42,691 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-11-07 01:13:42,691 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-11-07 01:13:42,691 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (< 4368 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse0 .cse1))) [2019-11-07 01:13:42,692 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-11-07 01:13:42,692 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-11-07 01:13:42,692 INFO L443 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:42,692 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-11-07 01:13:42,692 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-11-07 01:13:42,692 INFO L439 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-11-07 01:13:42,692 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-11-07 01:13:42,692 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-11-07 01:13:42,693 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-11-07 01:13:42,693 INFO L439 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-11-07 01:13:42,693 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-11-07 01:13:42,693 INFO L443 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-11-07 01:13:42,693 INFO L446 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-11-07 01:13:42,693 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-11-07 01:13:42,693 INFO L443 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2019-11-07 01:13:42,693 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-11-07 01:13:42,694 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-11-07 01:13:42,694 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-11-07 01:13:42,694 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-11-07 01:13:42,694 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-11-07 01:13:42,694 INFO L443 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-11-07 01:13:42,694 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-11-07 01:13:42,694 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-11-07 01:13:42,694 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-11-07 01:13:42,695 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-11-07 01:13:42,695 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-11-07 01:13:42,695 INFO L443 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-11-07 01:13:42,695 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-11-07 01:13:42,695 INFO L443 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-11-07 01:13:42,695 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-11-07 01:13:42,695 INFO L439 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-07 01:13:42,695 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-11-07 01:13:42,696 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-11-07 01:13:42,696 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-11-07 01:13:42,696 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-11-07 01:13:42,696 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-11-07 01:13:42,696 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-11-07 01:13:42,696 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2019-11-07 01:13:42,696 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-07 01:13:42,696 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-11-07 01:13:42,697 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2019-11-07 01:13:42,697 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-11-07 01:13:42,697 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-11-07 01:13:42,697 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2019-11-07 01:13:42,697 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-11-07 01:13:42,697 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-11-07 01:13:42,697 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-11-07 01:13:42,697 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-11-07 01:13:42,697 INFO L439 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2019-11-07 01:13:42,698 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (< ssl3_connect_~s__state~0 4400) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0)))) [2019-11-07 01:13:42,698 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-11-07 01:13:42,698 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-11-07 01:13:42,698 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2019-11-07 01:13:42,698 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-11-07 01:13:42,698 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2019-11-07 01:13:42,698 INFO L443 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:42,699 INFO L439 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse6 (= ssl3_connect_~s__state~0 4512)) (.cse2 (= 4448 ssl3_connect_~s__state~0)) (.cse8 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= 4560 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 3)) (.cse4 (= 4400 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~blastFlag~0 2)) (.cse14 (not .cse1)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse17 (<= 4352 ssl3_connect_~s__state~0)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse15 (= 4464 ssl3_connect_~s__state~0)) (.cse7 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 (= 4416 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse1) (and .cse5 .cse6) (and .cse3 .cse7 .cse1) (and .cse5 (= 4384 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse8) (and .cse6 .cse0 .cse1) (and .cse3 .cse9 .cse1) (and .cse5 .cse9) (and .cse10 .cse5 .cse1) (and .cse9 .cse0 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse3 .cse6 .cse1) (and .cse3 .cse1 .cse2) (and .cse3 .cse1 .cse8) (and .cse3 .cse11 .cse1 .cse12 .cse13) (and .cse5 .cse11 .cse14 .cse12) (and .cse10 .cse3) (and .cse3 .cse15 .cse1) (and .cse5 .cse4 .cse1) (and .cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse16 .cse17 .cse14) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse16 .cse17 .cse1 .cse13) (and .cse15 .cse0 .cse1) (and .cse7 .cse0 .cse1) (<= ssl3_connect_~blastFlag~0 0)))) [2019-11-07 01:13:42,699 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-11-07 01:13:42,699 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-11-07 01:13:42,699 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-11-07 01:13:42,699 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-11-07 01:13:42,699 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-11-07 01:13:42,699 INFO L439 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-11-07 01:13:42,700 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L443 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-11-07 01:13:42,701 INFO L439 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 (not .cse2)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse2 .cse1 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) (< ssl3_connect_~s__state~0 12292) .cse0))) [2019-11-07 01:13:42,702 INFO L439 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (< ssl3_connect_~s__state~0 4400) (< 4368 ssl3_connect_~s__state~0))) [2019-11-07 01:13:42,702 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-11-07 01:13:42,702 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-11-07 01:13:42,702 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-11-07 01:13:42,702 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-11-07 01:13:42,702 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-11-07 01:13:42,702 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-11-07 01:13:42,702 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-11-07 01:13:42,703 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-11-07 01:13:42,703 INFO L439 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-11-07 01:13:42,703 INFO L439 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2019-11-07 01:13:42,703 INFO L443 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-11-07 01:13:42,703 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-11-07 01:13:42,703 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-11-07 01:13:42,703 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-11-07 01:13:42,703 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-11-07 01:13:42,704 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-11-07 01:13:42,704 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-11-07 01:13:42,704 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-11-07 01:13:42,704 INFO L439 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (< 4368 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse2 .cse0 .cse1))) [2019-11-07 01:13:42,704 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-07 01:13:42,704 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-11-07 01:13:42,704 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:13:42,705 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 01:13:42,705 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 01:13:42,705 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 01:13:42,705 INFO L439 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2019-11-07 01:13:42,705 INFO L443 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2019-11-07 01:13:42,705 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2019-11-07 01:13:42,705 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2019-11-07 01:13:42,705 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2019-11-07 01:13:42,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:13:42 BoogieIcfgContainer [2019-11-07 01:13:42,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 01:13:42,747 INFO L168 Benchmark]: Toolchain (without parser) took 25175.13 ms. Allocated memory was 144.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 100.6 MB in the beginning and 812.6 MB in the end (delta: -712.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-11-07 01:13:42,748 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 01:13:42,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.42 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.4 MB in the beginning and 177.1 MB in the end (delta: -76.7 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:42,749 INFO L168 Benchmark]: Boogie Preprocessor took 52.35 ms. Allocated memory is still 201.3 MB. Free memory was 177.1 MB in the beginning and 175.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:42,750 INFO L168 Benchmark]: RCFGBuilder took 802.57 ms. Allocated memory is still 201.3 MB. Free memory was 174.3 MB in the beginning and 127.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:42,750 INFO L168 Benchmark]: TraceAbstraction took 23777.46 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 127.9 MB in the beginning and 812.6 MB in the end (delta: -684.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-11-07 01:13:42,753 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 535.42 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.4 MB in the beginning and 177.1 MB in the end (delta: -76.7 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.35 ms. Allocated memory is still 201.3 MB. Free memory was 177.1 MB in the beginning and 175.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.57 ms. Allocated memory is still 201.3 MB. Free memory was 174.3 MB in the beginning and 127.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23777.46 ms. Allocated memory was 201.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 127.9 MB in the beginning and 812.6 MB in the end (delta: -684.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state < 12292) && 4560 <= s__state) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && s__state <= 4560) && 4368 < s__state)) || (((blastFlag <= 4 && s__hit == 0) && s__state <= 4560) && 4368 < s__state) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (s__state < 4400 && blastFlag <= 0 && 4352 <= s__state) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && 4416 == s__state) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || (blastFlag <= 2 && 4384 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || blastFlag <= 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((blastFlag <= 0 && s__state <= 4560) && 4368 < s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4368 < s__state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4368 < s__state) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && s__state < 4400) && 4368 < s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 23.6s, OverallIterations: 26, TraceHistogramMax: 22, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, HoareTripleCheckerStatistics: 5377 SDtfs, 2550 SDslu, 3771 SDs, 0 SdLazy, 3190 SolverSat, 579 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4574 GetRequests, 4523 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8518occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 6269 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 265 NumberOfFragments, 777 HoareAnnotationTreeSize, 26 FomulaSimplifications, 24051 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2626 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 8697 NumberOfCodeBlocks, 8517 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 10903 ConstructedInterpolants, 0 QuantifiedInterpolants, 6362445 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3772 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 36 InterpolantComputations, 25 PerfectInterpolantSequences, 49367/49478 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...