/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_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:13:16,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:13:16,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:13:16,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:13:16,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:13:16,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:13:16,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:13:16,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:13:16,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:13:16,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:13:16,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:13:16,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:13:16,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:13:16,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:13:16,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:13:16,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:13:16,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:13:16,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:13:16,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:13:16,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:13:16,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:13:16,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:13:16,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:13:16,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:13:16,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:13:16,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:13:16,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:13:16,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:13:16,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:13:16,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:13:16,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:13:16,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:13:16,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:13:16,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:13:16,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:13:16,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:13:16,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:13:16,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:13:16,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:13:16,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:13:16,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:13:16,605 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,621 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:13:16,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:13:16,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:13:16,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:13:16,628 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:13:16,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:13:16,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:13:16,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:13:16,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:13:16,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:13:16,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:13:16,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:13:16,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:13:16,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:13:16,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:13:16,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:13:16,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:13:16,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:13:16,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:13:16,635 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:13:16,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:13:16,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:13:16,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:13:16,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:13:16,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:13:16,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:13:16,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:13:16,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:13:16,639 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,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:13:16,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:13:16,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:13:16,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:13:16,949 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:13:16,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-07 01:13:17,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ff99e34/6ba66cbe68994b7e915a0cd2771e79ec/FLAG9f45bf561 [2019-11-07 01:13:17,561 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:13:17,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-07 01:13:17,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ff99e34/6ba66cbe68994b7e915a0cd2771e79ec/FLAG9f45bf561 [2019-11-07 01:13:17,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ff99e34/6ba66cbe68994b7e915a0cd2771e79ec [2019-11-07 01:13:17,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:13:17,885 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:13:17,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:17,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:13:17,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:13:17,891 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,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fac3e93 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,894 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,901 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:13:17,949 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:13:18,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:18,197 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:13:18,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:13:18,362 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:13:18,362 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,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:13:18,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:13:18,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:13:18,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:13:18,375 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,376 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,384 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,384 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,399 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,417 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,419 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,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:13:18,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:13:18,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:13:18,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:13:18,425 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,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:13:18,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:13:18,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-11-07 01:13:18,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:13:18,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:13:18,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:13:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-11-07 01:13:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:13:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:13:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:13:18,606 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 01:13:19,077 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-07 01:13:19,077 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-07 01:13:19,088 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:13:19,088 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:13:19,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:19 BoogieIcfgContainer [2019-11-07 01:13:19,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:13:19,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:13:19,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:13:19,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:13:19,095 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:19,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af30aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:19, skipping insertion in model container [2019-11-07 01:13:19,096 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:19,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af30aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:19, skipping insertion in model container [2019-11-07 01:13:19,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:19" (3/3) ... [2019-11-07 01:13:19,099 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-11-07 01:13:19,110 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:13:19,121 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:13:19,133 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:13:19,172 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:13:19,173 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:13:19,173 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:13:19,173 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:13:19,174 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:13:19,174 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:13:19,174 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:13:19,174 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:13:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-11-07 01:13:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 01:13:19,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:19,213 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,215 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2007307722, now seen corresponding path program 1 times [2019-11-07 01:13:19,228 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:19,228 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585217992] [2019-11-07 01:13:19,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:19,449 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,450 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585217992] [2019-11-07 01:13:19,450 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:19,451 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:19,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306271753] [2019-11-07 01:13:19,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:19,463 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:19,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:19,478 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2019-11-07 01:13:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:19,608 INFO L93 Difference]: Finished difference Result 365 states and 622 transitions. [2019-11-07 01:13:19,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:19,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 01:13:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:19,624 INFO L225 Difference]: With dead ends: 365 [2019-11-07 01:13:19,624 INFO L226 Difference]: Without dead ends: 214 [2019-11-07 01:13:19,628 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,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-07 01:13:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-11-07 01:13:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-07 01:13:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-11-07 01:13:19,699 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 29 [2019-11-07 01:13:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:19,700 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-11-07 01:13:19,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-11-07 01:13:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 01:13:19,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:19,703 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,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1381474291, now seen corresponding path program 1 times [2019-11-07 01:13:19,705 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:19,705 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943053368] [2019-11-07 01:13:19,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:19,792 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,792 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943053368] [2019-11-07 01:13:19,792 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:19,793 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:19,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222276935] [2019-11-07 01:13:19,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:19,795 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:19,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:19,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:19,796 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-11-07 01:13:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:20,038 INFO L93 Difference]: Finished difference Result 460 states and 698 transitions. [2019-11-07 01:13:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:20,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-07 01:13:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:20,041 INFO L225 Difference]: With dead ends: 460 [2019-11-07 01:13:20,042 INFO L226 Difference]: Without dead ends: 258 [2019-11-07 01:13:20,044 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,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-07 01:13:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2019-11-07 01:13:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-07 01:13:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2019-11-07 01:13:20,066 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 43 [2019-11-07 01:13:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:20,066 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2019-11-07 01:13:20,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2019-11-07 01:13:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:13:20,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:20,070 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,070 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash 632602009, now seen corresponding path program 1 times [2019-11-07 01:13:20,071 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:20,071 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717236359] [2019-11-07 01:13:20,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:20,148 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,149 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717236359] [2019-11-07 01:13:20,150 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:20,150 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:20,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217893588] [2019-11-07 01:13:20,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:20,154 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:20,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:20,154 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand 3 states. [2019-11-07 01:13:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:20,399 INFO L93 Difference]: Finished difference Result 584 states and 888 transitions. [2019-11-07 01:13:20,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:20,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:13:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:20,404 INFO L225 Difference]: With dead ends: 584 [2019-11-07 01:13:20,405 INFO L226 Difference]: Without dead ends: 346 [2019-11-07 01:13:20,409 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,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-07 01:13:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2019-11-07 01:13:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-07 01:13:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 464 transitions. [2019-11-07 01:13:20,461 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 464 transitions. Word has length 60 [2019-11-07 01:13:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:20,462 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 464 transitions. [2019-11-07 01:13:20,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 464 transitions. [2019-11-07 01:13:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:13:20,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:20,473 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,473 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1172836325, now seen corresponding path program 1 times [2019-11-07 01:13:20,476 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:20,477 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635900988] [2019-11-07 01:13:20,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:20,586 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,586 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635900988] [2019-11-07 01:13:20,586 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:20,587 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:20,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900605857] [2019-11-07 01:13:20,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:20,588 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:20,589 INFO L87 Difference]: Start difference. First operand 330 states and 464 transitions. Second operand 3 states. [2019-11-07 01:13:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:20,762 INFO L93 Difference]: Finished difference Result 694 states and 991 transitions. [2019-11-07 01:13:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:20,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:13:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:20,768 INFO L225 Difference]: With dead ends: 694 [2019-11-07 01:13:20,768 INFO L226 Difference]: Without dead ends: 376 [2019-11-07 01:13:20,769 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,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-07 01:13:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2019-11-07 01:13:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-07 01:13:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 512 transitions. [2019-11-07 01:13:20,792 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 512 transitions. Word has length 60 [2019-11-07 01:13:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:20,793 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 512 transitions. [2019-11-07 01:13:20,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 512 transitions. [2019-11-07 01:13:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-07 01:13:20,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:20,797 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] [2019-11-07 01:13:20,797 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:20,798 INFO L82 PathProgramCache]: Analyzing trace with hash 244907033, now seen corresponding path program 1 times [2019-11-07 01:13:20,798 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:20,798 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510132769] [2019-11-07 01:13:20,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:20,858 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,859 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510132769] [2019-11-07 01:13:20,859 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:20,859 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:20,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137312592] [2019-11-07 01:13:20,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:20,861 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:20,863 INFO L87 Difference]: Start difference. First operand 368 states and 512 transitions. Second operand 3 states. [2019-11-07 01:13:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:21,063 INFO L93 Difference]: Finished difference Result 828 states and 1190 transitions. [2019-11-07 01:13:21,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:21,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-07 01:13:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:21,069 INFO L225 Difference]: With dead ends: 828 [2019-11-07 01:13:21,069 INFO L226 Difference]: Without dead ends: 470 [2019-11-07 01:13:21,070 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,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-07 01:13:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 446. [2019-11-07 01:13:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-11-07 01:13:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2019-11-07 01:13:21,086 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 72 [2019-11-07 01:13:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,087 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2019-11-07 01:13:21,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2019-11-07 01:13:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-07 01:13:21,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,090 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,090 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,091 INFO L82 PathProgramCache]: Analyzing trace with hash -834546447, now seen corresponding path program 1 times [2019-11-07 01:13:21,091 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,091 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440129205] [2019-11-07 01:13:21,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:21,147 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,147 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440129205] [2019-11-07 01:13:21,147 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:21,148 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:21,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800325612] [2019-11-07 01:13:21,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:21,149 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:21,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:21,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:21,149 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand 3 states. [2019-11-07 01:13:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:21,287 INFO L93 Difference]: Finished difference Result 928 states and 1353 transitions. [2019-11-07 01:13:21,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:21,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-07 01:13:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:21,292 INFO L225 Difference]: With dead ends: 928 [2019-11-07 01:13:21,292 INFO L226 Difference]: Without dead ends: 494 [2019-11-07 01:13:21,294 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,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-11-07 01:13:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2019-11-07 01:13:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-07 01:13:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 698 transitions. [2019-11-07 01:13:21,313 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 698 transitions. Word has length 76 [2019-11-07 01:13:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,314 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 698 transitions. [2019-11-07 01:13:21,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 698 transitions. [2019-11-07 01:13:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-07 01:13:21,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,317 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,318 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash -532111447, now seen corresponding path program 1 times [2019-11-07 01:13:21,323 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,324 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91780471] [2019-11-07 01:13:21,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:21,441 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,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91780471] [2019-11-07 01:13:21,449 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:21,449 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:21,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195258339] [2019-11-07 01:13:21,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:21,450 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:21,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:21,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:21,451 INFO L87 Difference]: Start difference. First operand 488 states and 698 transitions. Second operand 3 states. [2019-11-07 01:13:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:21,526 INFO L93 Difference]: Finished difference Result 964 states and 1385 transitions. [2019-11-07 01:13:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:21,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-07 01:13:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:21,532 INFO L225 Difference]: With dead ends: 964 [2019-11-07 01:13:21,532 INFO L226 Difference]: Without dead ends: 725 [2019-11-07 01:13:21,534 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,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-11-07 01:13:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2019-11-07 01:13:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-11-07 01:13:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2019-11-07 01:13:21,560 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 96 [2019-11-07 01:13:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,560 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2019-11-07 01:13:21,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2019-11-07 01:13:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 01:13:21,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,564 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2130642131, now seen corresponding path program 1 times [2019-11-07 01:13:21,565 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,565 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684610819] [2019-11-07 01:13:21,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:21,650 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,651 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684610819] [2019-11-07 01:13:21,651 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:21,651 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:21,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937541836] [2019-11-07 01:13:21,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:21,653 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:21,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:21,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:21,653 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2019-11-07 01:13:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:21,706 INFO L93 Difference]: Finished difference Result 964 states and 1382 transitions. [2019-11-07 01:13:21,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:21,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-07 01:13:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:21,714 INFO L225 Difference]: With dead ends: 964 [2019-11-07 01:13:21,714 INFO L226 Difference]: Without dead ends: 962 [2019-11-07 01:13:21,716 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,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-11-07 01:13:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-11-07 01:13:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-11-07 01:13:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2019-11-07 01:13:21,751 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 98 [2019-11-07 01:13:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:21,752 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2019-11-07 01:13:21,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2019-11-07 01:13:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:13:21,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:21,757 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:21,757 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:21,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1135672730, now seen corresponding path program 1 times [2019-11-07 01:13:21,758 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:21,758 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195223733] [2019-11-07 01:13:21,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-07 01:13:21,880 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195223733] [2019-11-07 01:13:21,881 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:21,881 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:21,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165177312] [2019-11-07 01:13:21,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:21,883 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:21,883 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand 3 states. [2019-11-07 01:13:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:22,057 INFO L93 Difference]: Finished difference Result 2112 states and 3080 transitions. [2019-11-07 01:13:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:22,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-07 01:13:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:22,064 INFO L225 Difference]: With dead ends: 2112 [2019-11-07 01:13:22,064 INFO L226 Difference]: Without dead ends: 1154 [2019-11-07 01:13:22,067 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,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-11-07 01:13:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2019-11-07 01:13:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-11-07 01:13:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1620 transitions. [2019-11-07 01:13:22,099 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1620 transitions. Word has length 152 [2019-11-07 01:13:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:22,100 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 1620 transitions. [2019-11-07 01:13:22,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1620 transitions. [2019-11-07 01:13:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-07 01:13:22,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:22,105 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:22,105 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:22,105 INFO L82 PathProgramCache]: Analyzing trace with hash -862106901, now seen corresponding path program 1 times [2019-11-07 01:13:22,106 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:22,106 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442254157] [2019-11-07 01:13:22,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-07 01:13:22,178 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442254157] [2019-11-07 01:13:22,179 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:22,179 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:22,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780350578] [2019-11-07 01:13:22,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:22,180 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:22,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:22,181 INFO L87 Difference]: Start difference. First operand 1118 states and 1620 transitions. Second operand 3 states. [2019-11-07 01:13:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:22,311 INFO L93 Difference]: Finished difference Result 2330 states and 3354 transitions. [2019-11-07 01:13:22,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:22,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-07 01:13:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:22,319 INFO L225 Difference]: With dead ends: 2330 [2019-11-07 01:13:22,319 INFO L226 Difference]: Without dead ends: 1224 [2019-11-07 01:13:22,328 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,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-11-07 01:13:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1210. [2019-11-07 01:13:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-11-07 01:13:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1732 transitions. [2019-11-07 01:13:22,384 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1732 transitions. Word has length 188 [2019-11-07 01:13:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:22,384 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1732 transitions. [2019-11-07 01:13:22,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1732 transitions. [2019-11-07 01:13:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-07 01:13:22,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:22,389 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:22,390 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:22,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2139251602, now seen corresponding path program 1 times [2019-11-07 01:13:22,390 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:22,390 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329087450] [2019-11-07 01:13:22,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-07 01:13:22,453 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329087450] [2019-11-07 01:13:22,453 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:22,453 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:22,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339519793] [2019-11-07 01:13:22,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:22,454 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:22,455 INFO L87 Difference]: Start difference. First operand 1210 states and 1732 transitions. Second operand 3 states. [2019-11-07 01:13:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:22,601 INFO L93 Difference]: Finished difference Result 2520 states and 3596 transitions. [2019-11-07 01:13:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:22,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-07 01:13:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:22,609 INFO L225 Difference]: With dead ends: 2520 [2019-11-07 01:13:22,609 INFO L226 Difference]: Without dead ends: 1322 [2019-11-07 01:13:22,611 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,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-07 01:13:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1310. [2019-11-07 01:13:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-07 01:13:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1852 transitions. [2019-11-07 01:13:22,646 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1852 transitions. Word has length 209 [2019-11-07 01:13:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:22,646 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1852 transitions. [2019-11-07 01:13:22,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1852 transitions. [2019-11-07 01:13:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-07 01:13:22,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:22,651 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:22,652 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:22,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1924345883, now seen corresponding path program 1 times [2019-11-07 01:13:22,652 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:22,652 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508121592] [2019-11-07 01:13:22,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-07 01:13:22,745 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508121592] [2019-11-07 01:13:22,745 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:22,745 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:22,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296444650] [2019-11-07 01:13:22,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:22,746 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:22,747 INFO L87 Difference]: Start difference. First operand 1310 states and 1852 transitions. Second operand 3 states. [2019-11-07 01:13:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:22,994 INFO L93 Difference]: Finished difference Result 2728 states and 3848 transitions. [2019-11-07 01:13:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:22,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-07 01:13:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:23,005 INFO L225 Difference]: With dead ends: 2728 [2019-11-07 01:13:23,005 INFO L226 Difference]: Without dead ends: 1430 [2019-11-07 01:13:23,009 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,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-11-07 01:13:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1422. [2019-11-07 01:13:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-11-07 01:13:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1984 transitions. [2019-11-07 01:13:23,060 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1984 transitions. Word has length 233 [2019-11-07 01:13:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:23,061 INFO L462 AbstractCegarLoop]: Abstraction has 1422 states and 1984 transitions. [2019-11-07 01:13:23,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1984 transitions. [2019-11-07 01:13:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-07 01:13:23,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:23,071 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:23,072 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash -643476451, now seen corresponding path program 1 times [2019-11-07 01:13:23,072 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:23,073 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16665852] [2019-11-07 01:13:23,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-07 01:13:23,201 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16665852] [2019-11-07 01:13:23,201 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:23,201 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:23,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207248871] [2019-11-07 01:13:23,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:23,202 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:23,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:23,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:23,203 INFO L87 Difference]: Start difference. First operand 1422 states and 1984 transitions. Second operand 3 states. [2019-11-07 01:13:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:23,351 INFO L93 Difference]: Finished difference Result 2968 states and 4148 transitions. [2019-11-07 01:13:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:23,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-07 01:13:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:23,360 INFO L225 Difference]: With dead ends: 2968 [2019-11-07 01:13:23,360 INFO L226 Difference]: Without dead ends: 1558 [2019-11-07 01:13:23,364 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,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-11-07 01:13:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2019-11-07 01:13:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-11-07 01:13:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2128 transitions. [2019-11-07 01:13:23,407 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2128 transitions. Word has length 233 [2019-11-07 01:13:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:23,407 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 2128 transitions. [2019-11-07 01:13:23,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2128 transitions. [2019-11-07 01:13:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-07 01:13:23,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:23,414 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:23,414 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1388986723, now seen corresponding path program 1 times [2019-11-07 01:13:23,415 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:23,415 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135300803] [2019-11-07 01:13:23,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-07 01:13:23,522 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135300803] [2019-11-07 01:13:23,522 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:23,522 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:23,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882487604] [2019-11-07 01:13:23,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:23,523 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:23,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:23,524 INFO L87 Difference]: Start difference. First operand 1546 states and 2128 transitions. Second operand 3 states. [2019-11-07 01:13:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:23,679 INFO L93 Difference]: Finished difference Result 3232 states and 4464 transitions. [2019-11-07 01:13:23,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:23,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-07 01:13:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:23,688 INFO L225 Difference]: With dead ends: 3232 [2019-11-07 01:13:23,689 INFO L226 Difference]: Without dead ends: 1698 [2019-11-07 01:13:23,692 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,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-11-07 01:13:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1690. [2019-11-07 01:13:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-11-07 01:13:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2292 transitions. [2019-11-07 01:13:23,735 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2292 transitions. Word has length 263 [2019-11-07 01:13:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:23,736 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 2292 transitions. [2019-11-07 01:13:23,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2292 transitions. [2019-11-07 01:13:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-07 01:13:23,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:23,747 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:23,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1178835611, now seen corresponding path program 1 times [2019-11-07 01:13:23,749 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:23,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542093382] [2019-11-07 01:13:23,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-07 01:13:23,886 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542093382] [2019-11-07 01:13:23,886 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:23,886 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:23,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892973895] [2019-11-07 01:13:23,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:23,888 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:23,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:23,889 INFO L87 Difference]: Start difference. First operand 1690 states and 2292 transitions. Second operand 3 states. [2019-11-07 01:13:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:23,957 INFO L93 Difference]: Finished difference Result 5038 states and 6836 transitions. [2019-11-07 01:13:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:23,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-07 01:13:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:23,980 INFO L225 Difference]: With dead ends: 5038 [2019-11-07 01:13:23,981 INFO L226 Difference]: Without dead ends: 3360 [2019-11-07 01:13:23,987 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,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-11-07 01:13:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2019-11-07 01:13:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3358 states. [2019-11-07 01:13:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4555 transitions. [2019-11-07 01:13:24,120 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4555 transitions. Word has length 263 [2019-11-07 01:13:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:24,121 INFO L462 AbstractCegarLoop]: Abstraction has 3358 states and 4555 transitions. [2019-11-07 01:13:24,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4555 transitions. [2019-11-07 01:13:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-11-07 01:13:24,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:24,141 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:24,141 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:24,142 INFO L82 PathProgramCache]: Analyzing trace with hash 554282629, now seen corresponding path program 1 times [2019-11-07 01:13:24,142 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:24,142 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907803305] [2019-11-07 01:13:24,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-07 01:13:24,336 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907803305] [2019-11-07 01:13:24,337 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:24,337 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:24,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861690374] [2019-11-07 01:13:24,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:24,338 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:24,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:24,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:24,339 INFO L87 Difference]: Start difference. First operand 3358 states and 4555 transitions. Second operand 3 states. [2019-11-07 01:13:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:24,592 INFO L93 Difference]: Finished difference Result 6852 states and 9306 transitions. [2019-11-07 01:13:24,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:24,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-11-07 01:13:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:24,616 INFO L225 Difference]: With dead ends: 6852 [2019-11-07 01:13:24,616 INFO L226 Difference]: Without dead ends: 3506 [2019-11-07 01:13:24,627 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,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-11-07 01:13:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-11-07 01:13:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-11-07 01:13:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4707 transitions. [2019-11-07 01:13:24,754 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4707 transitions. Word has length 287 [2019-11-07 01:13:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:24,755 INFO L462 AbstractCegarLoop]: Abstraction has 3490 states and 4707 transitions. [2019-11-07 01:13:24,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4707 transitions. [2019-11-07 01:13:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-07 01:13:24,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:24,773 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:24,773 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:24,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1163110431, now seen corresponding path program 1 times [2019-11-07 01:13:24,774 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:24,774 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446121312] [2019-11-07 01:13:24,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-07 01:13:25,006 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446121312] [2019-11-07 01:13:25,006 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:25,007 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:25,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974785343] [2019-11-07 01:13:25,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:25,008 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:25,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:25,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:25,009 INFO L87 Difference]: Start difference. First operand 3490 states and 4707 transitions. Second operand 3 states. [2019-11-07 01:13:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:25,263 INFO L93 Difference]: Finished difference Result 7360 states and 10062 transitions. [2019-11-07 01:13:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:25,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-07 01:13:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:25,282 INFO L225 Difference]: With dead ends: 7360 [2019-11-07 01:13:25,282 INFO L226 Difference]: Without dead ends: 3882 [2019-11-07 01:13:25,289 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,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-11-07 01:13:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3802. [2019-11-07 01:13:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2019-11-07 01:13:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5075 transitions. [2019-11-07 01:13:25,385 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5075 transitions. Word has length 298 [2019-11-07 01:13:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:25,386 INFO L462 AbstractCegarLoop]: Abstraction has 3802 states and 5075 transitions. [2019-11-07 01:13:25,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5075 transitions. [2019-11-07 01:13:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-11-07 01:13:25,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:25,397 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:25,397 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -121210371, now seen corresponding path program 1 times [2019-11-07 01:13:25,398 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:25,398 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963879431] [2019-11-07 01:13:25,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-07 01:13:25,507 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963879431] [2019-11-07 01:13:25,507 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:25,508 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:25,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408848368] [2019-11-07 01:13:25,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:25,509 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:25,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:25,509 INFO L87 Difference]: Start difference. First operand 3802 states and 5075 transitions. Second operand 3 states. [2019-11-07 01:13:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:25,736 INFO L93 Difference]: Finished difference Result 7992 states and 10606 transitions. [2019-11-07 01:13:25,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:25,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-11-07 01:13:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:25,780 INFO L225 Difference]: With dead ends: 7992 [2019-11-07 01:13:25,780 INFO L226 Difference]: Without dead ends: 4202 [2019-11-07 01:13:25,789 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,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-11-07 01:13:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3922. [2019-11-07 01:13:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-11-07 01:13:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5219 transitions. [2019-11-07 01:13:25,952 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5219 transitions. Word has length 311 [2019-11-07 01:13:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:25,953 INFO L462 AbstractCegarLoop]: Abstraction has 3922 states and 5219 transitions. [2019-11-07 01:13:25,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5219 transitions. [2019-11-07 01:13:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-07 01:13:25,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:25,964 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:25,964 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash -828607418, now seen corresponding path program 1 times [2019-11-07 01:13:25,965 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:25,965 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327130006] [2019-11-07 01:13:25,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-07 01:13:26,096 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327130006] [2019-11-07 01:13:26,096 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:26,096 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:26,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259249836] [2019-11-07 01:13:26,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:26,097 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:26,098 INFO L87 Difference]: Start difference. First operand 3922 states and 5219 transitions. Second operand 3 states. [2019-11-07 01:13:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:26,192 INFO L93 Difference]: Finished difference Result 11238 states and 15033 transitions. [2019-11-07 01:13:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:26,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-11-07 01:13:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:26,211 INFO L225 Difference]: With dead ends: 11238 [2019-11-07 01:13:26,212 INFO L226 Difference]: Without dead ends: 7328 [2019-11-07 01:13:26,221 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,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-11-07 01:13:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7326. [2019-11-07 01:13:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-11-07 01:13:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9805 transitions. [2019-11-07 01:13:26,371 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9805 transitions. Word has length 312 [2019-11-07 01:13:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:26,372 INFO L462 AbstractCegarLoop]: Abstraction has 7326 states and 9805 transitions. [2019-11-07 01:13:26,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9805 transitions. [2019-11-07 01:13:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-07 01:13:26,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:26,387 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:26,387 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:26,388 INFO L82 PathProgramCache]: Analyzing trace with hash -935849662, now seen corresponding path program 1 times [2019-11-07 01:13:26,388 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:26,388 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745962242] [2019-11-07 01:13:26,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-07 01:13:26,531 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745962242] [2019-11-07 01:13:26,531 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:26,531 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:26,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207795238] [2019-11-07 01:13:26,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:26,532 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:26,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:26,533 INFO L87 Difference]: Start difference. First operand 7326 states and 9805 transitions. Second operand 3 states. [2019-11-07 01:13:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:26,744 INFO L93 Difference]: Finished difference Result 14648 states and 19586 transitions. [2019-11-07 01:13:26,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:26,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-11-07 01:13:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:26,761 INFO L225 Difference]: With dead ends: 14648 [2019-11-07 01:13:26,762 INFO L226 Difference]: Without dead ends: 7334 [2019-11-07 01:13:26,776 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,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-11-07 01:13:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 7302. [2019-11-07 01:13:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-11-07 01:13:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9525 transitions. [2019-11-07 01:13:26,913 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9525 transitions. Word has length 313 [2019-11-07 01:13:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:26,914 INFO L462 AbstractCegarLoop]: Abstraction has 7302 states and 9525 transitions. [2019-11-07 01:13:26,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9525 transitions. [2019-11-07 01:13:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-07 01:13:26,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:26,927 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:26,927 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:26,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:26,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1555626477, now seen corresponding path program 1 times [2019-11-07 01:13:26,928 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:26,928 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190957980] [2019-11-07 01:13:26,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 765 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-07 01:13:27,054 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190957980] [2019-11-07 01:13:27,054 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621950910] [2019-11-07 01:13:27,055 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,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:27,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:13:27,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-11-07 01:13:27,500 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-11-07 01:13:27,704 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:27,704 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:13:27,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244824040] [2019-11-07 01:13:27,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:27,706 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:27,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:27,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:27,707 INFO L87 Difference]: Start difference. First operand 7302 states and 9525 transitions. Second operand 3 states. [2019-11-07 01:13:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:27,944 INFO L93 Difference]: Finished difference Result 18220 states and 23754 transitions. [2019-11-07 01:13:27,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:27,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-07 01:13:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:27,972 INFO L225 Difference]: With dead ends: 18220 [2019-11-07 01:13:27,972 INFO L226 Difference]: Without dead ends: 10930 [2019-11-07 01:13:28,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 671 SyntacticMatches, 1 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:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2019-11-07 01:13:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 10930. [2019-11-07 01:13:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10930 states. [2019-11-07 01:13:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10930 states to 10930 states and 14229 transitions. [2019-11-07 01:13:28,356 INFO L78 Accepts]: Start accepts. Automaton has 10930 states and 14229 transitions. Word has length 336 [2019-11-07 01:13:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:28,357 INFO L462 AbstractCegarLoop]: Abstraction has 10930 states and 14229 transitions. [2019-11-07 01:13:28,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10930 states and 14229 transitions. [2019-11-07 01:13:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-07 01:13:28,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:28,377 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:28,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:28,583 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:28,584 INFO L82 PathProgramCache]: Analyzing trace with hash 451618901, now seen corresponding path program 1 times [2019-11-07 01:13:28,584 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:28,584 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939603423] [2019-11-07 01:13:28,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 767 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-07 01:13:28,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939603423] [2019-11-07 01:13:28,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409500546] [2019-11-07 01:13:28,770 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,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:28,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 01:13:28,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2019-11-07 01:13:29,018 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2019-11-07 01:13:29,266 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:29,267 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2019-11-07 01:13:29,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646854087] [2019-11-07 01:13:29,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:13:29,269 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:29,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:13:29,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:13:29,269 INFO L87 Difference]: Start difference. First operand 10930 states and 14229 transitions. Second operand 8 states. [2019-11-07 01:13:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:29,743 INFO L93 Difference]: Finished difference Result 22146 states and 28843 transitions. [2019-11-07 01:13:29,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:13:29,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 338 [2019-11-07 01:13:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:29,764 INFO L225 Difference]: With dead ends: 22146 [2019-11-07 01:13:29,765 INFO L226 Difference]: Without dead ends: 11200 [2019-11-07 01:13:29,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 671 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:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11200 states. [2019-11-07 01:13:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11200 to 10936. [2019-11-07 01:13:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10936 states. [2019-11-07 01:13:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10936 states to 10936 states and 14237 transitions. [2019-11-07 01:13:29,993 INFO L78 Accepts]: Start accepts. Automaton has 10936 states and 14237 transitions. Word has length 338 [2019-11-07 01:13:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:29,993 INFO L462 AbstractCegarLoop]: Abstraction has 10936 states and 14237 transitions. [2019-11-07 01:13:29,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:13:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 10936 states and 14237 transitions. [2019-11-07 01:13:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-07 01:13:30,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:30,013 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:30,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:30,226 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1817523371, now seen corresponding path program 1 times [2019-11-07 01:13:30,227 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:30,227 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749062390] [2019-11-07 01:13:30,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-07 01:13:30,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749062390] [2019-11-07 01:13:30,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083762828] [2019-11-07 01:13:30,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:30,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:30,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-07 01:13:30,813 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-07 01:13:30,960 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [92962101] [2019-11-07 01:13:30,971 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 351 [2019-11-07 01:13:31,070 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:31,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:31,235 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:33,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:33,044 INFO L272 AbstractInterpreter]: Visited 108 different actions 2357 times. Merged at 98 different actions 1895 times. Widened at 22 different actions 229 times. Performed 5805 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5805 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 338 fixpoints after 36 different actions. Largest state had 69 variables. [2019-11-07 01:13:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:33,051 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:33,051 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:33,051 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:33,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093744473] [2019-11-07 01:13:33,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:33,052 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:33,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:33,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:33,053 INFO L87 Difference]: Start difference. First operand 10936 states and 14237 transitions. Second operand 6 states. [2019-11-07 01:13:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:33,736 INFO L93 Difference]: Finished difference Result 21892 states and 28499 transitions. [2019-11-07 01:13:33,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:13:33,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 350 [2019-11-07 01:13:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:33,773 INFO L225 Difference]: With dead ends: 21892 [2019-11-07 01:13:33,773 INFO L226 Difference]: Without dead ends: 16552 [2019-11-07 01:13:33,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 701 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:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16552 states. [2019-11-07 01:13:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16552 to 12568. [2019-11-07 01:13:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12568 states. [2019-11-07 01:13:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 16457 transitions. [2019-11-07 01:13:34,142 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 16457 transitions. Word has length 350 [2019-11-07 01:13:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:34,143 INFO L462 AbstractCegarLoop]: Abstraction has 12568 states and 16457 transitions. [2019-11-07 01:13:34,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 16457 transitions. [2019-11-07 01:13:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-11-07 01:13:34,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:34,166 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:34,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:34,372 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash -299155883, now seen corresponding path program 2 times [2019-11-07 01:13:34,373 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:34,373 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562262828] [2019-11-07 01:13:34,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-07 01:13:34,508 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562262828] [2019-11-07 01:13:34,509 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392777233] [2019-11-07 01:13:34,509 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 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:34,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-07 01:13:34,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 01:13:34,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:34,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-11-07 01:13:34,733 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-11-07 01:13:34,854 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:34,854 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:13:34,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401297338] [2019-11-07 01:13:34,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:34,859 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:34,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:34,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:34,860 INFO L87 Difference]: Start difference. First operand 12568 states and 16457 transitions. Second operand 3 states. [2019-11-07 01:13:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:35,103 INFO L93 Difference]: Finished difference Result 24326 states and 31258 transitions. [2019-11-07 01:13:35,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:35,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-11-07 01:13:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:35,138 INFO L225 Difference]: With dead ends: 24326 [2019-11-07 01:13:35,138 INFO L226 Difference]: Without dead ends: 11776 [2019-11-07 01:13:35,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11776 states. [2019-11-07 01:13:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11776 to 11416. [2019-11-07 01:13:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-11-07 01:13:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 14321 transitions. [2019-11-07 01:13:35,419 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 14321 transitions. Word has length 362 [2019-11-07 01:13:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:35,419 INFO L462 AbstractCegarLoop]: Abstraction has 11416 states and 14321 transitions. [2019-11-07 01:13:35,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 14321 transitions. [2019-11-07 01:13:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-11-07 01:13:35,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:35,434 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] [2019-11-07 01:13:35,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:35,638 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:35,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2019228612, now seen corresponding path program 1 times [2019-11-07 01:13:35,639 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:35,639 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412571118] [2019-11-07 01:13:35,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:35,785 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:35,786 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412571118] [2019-11-07 01:13:35,786 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020664198] [2019-11-07 01:13:35,786 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:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:35,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:35,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:35,993 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:35,994 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:36,093 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:36,094 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [635732236] [2019-11-07 01:13:36,095 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 377 [2019-11-07 01:13:36,106 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:36,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:36,115 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:37,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:37,646 INFO L272 AbstractInterpreter]: Visited 109 different actions 2344 times. Merged at 99 different actions 1868 times. Widened at 21 different actions 223 times. Performed 5913 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5913 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 351 fixpoints after 34 different actions. Largest state had 69 variables. [2019-11-07 01:13:37,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:37,646 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:37,646 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:37,647 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:37,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885001112] [2019-11-07 01:13:37,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:37,648 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:37,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:37,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:37,649 INFO L87 Difference]: Start difference. First operand 11416 states and 14321 transitions. Second operand 6 states. [2019-11-07 01:13:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:38,155 INFO L93 Difference]: Finished difference Result 25352 states and 31647 transitions. [2019-11-07 01:13:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:38,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 376 [2019-11-07 01:13:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:38,180 INFO L225 Difference]: With dead ends: 25352 [2019-11-07 01:13:38,180 INFO L226 Difference]: Without dead ends: 13942 [2019-11-07 01:13:38,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 752 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:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13942 states. [2019-11-07 01:13:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13942 to 11694. [2019-11-07 01:13:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11694 states. [2019-11-07 01:13:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 14578 transitions. [2019-11-07 01:13:38,411 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 14578 transitions. Word has length 376 [2019-11-07 01:13:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:38,412 INFO L462 AbstractCegarLoop]: Abstraction has 11694 states and 14578 transitions. [2019-11-07 01:13:38,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 14578 transitions. [2019-11-07 01:13:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-11-07 01:13:38,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:38,423 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] [2019-11-07 01:13:38,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:38,626 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:38,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1965718292, now seen corresponding path program 1 times [2019-11-07 01:13:38,627 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:38,627 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836042814] [2019-11-07 01:13:38,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:38,832 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:38,833 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836042814] [2019-11-07 01:13:38,833 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:13:38,833 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:13:38,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69070069] [2019-11-07 01:13:38,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:38,834 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:38,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:13:38,835 INFO L87 Difference]: Start difference. First operand 11694 states and 14578 transitions. Second operand 3 states. [2019-11-07 01:13:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:39,118 INFO L93 Difference]: Finished difference Result 22624 states and 27701 transitions. [2019-11-07 01:13:39,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:39,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2019-11-07 01:13:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:39,129 INFO L225 Difference]: With dead ends: 22624 [2019-11-07 01:13:39,129 INFO L226 Difference]: Without dead ends: 5426 [2019-11-07 01:13:39,143 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:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-11-07 01:13:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 5193. [2019-11-07 01:13:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2019-11-07 01:13:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6407 transitions. [2019-11-07 01:13:39,221 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6407 transitions. Word has length 415 [2019-11-07 01:13:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:39,222 INFO L462 AbstractCegarLoop]: Abstraction has 5193 states and 6407 transitions. [2019-11-07 01:13:39,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6407 transitions. [2019-11-07 01:13:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-11-07 01:13:39,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:39,230 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:39,230 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:39,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1027355828, now seen corresponding path program 1 times [2019-11-07 01:13:39,231 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:39,231 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52214843] [2019-11-07 01:13:39,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-11-07 01:13:39,489 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52214843] [2019-11-07 01:13:39,490 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992772184] [2019-11-07 01:13:39,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:39,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:39,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-11-07 01:13:39,851 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-11-07 01:13:40,046 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:13:40,046 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-11-07 01:13:40,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591338819] [2019-11-07 01:13:40,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:13:40,047 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:40,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:13:40,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:13:40,048 INFO L87 Difference]: Start difference. First operand 5193 states and 6407 transitions. Second operand 3 states. [2019-11-07 01:13:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:40,092 INFO L93 Difference]: Finished difference Result 5268 states and 6502 transitions. [2019-11-07 01:13:40,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:13:40,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-11-07 01:13:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:40,102 INFO L225 Difference]: With dead ends: 5268 [2019-11-07 01:13:40,102 INFO L226 Difference]: Without dead ends: 5192 [2019-11-07 01:13:40,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 998 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:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2019-11-07 01:13:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 5119. [2019-11-07 01:13:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5119 states. [2019-11-07 01:13:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 6316 transitions. [2019-11-07 01:13:40,198 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 6316 transitions. Word has length 499 [2019-11-07 01:13:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:40,200 INFO L462 AbstractCegarLoop]: Abstraction has 5119 states and 6316 transitions. [2019-11-07 01:13:40,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:13:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 6316 transitions. [2019-11-07 01:13:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-11-07 01:13:40,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:13:40,211 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:13:40,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:40,425 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:13:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash -241116614, now seen corresponding path program 1 times [2019-11-07 01:13:40,425 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:13:40,426 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613541138] [2019-11-07 01:13:40,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:13:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-07 01:13:40,735 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613541138] [2019-11-07 01:13:40,735 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421658139] [2019-11-07 01:13:40,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:13:40,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:13:40,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:13:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-07 01:13:41,033 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:13:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-07 01:13:41,199 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1109180080] [2019-11-07 01:13:41,199 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 610 [2019-11-07 01:13:41,203 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:13:41,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:13:41,209 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:13:42,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:13:42,085 INFO L272 AbstractInterpreter]: Visited 112 different actions 2220 times. Merged at 98 different actions 1802 times. Widened at 20 different actions 240 times. Performed 5590 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5590 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 286 fixpoints after 34 different actions. Largest state had 70 variables. [2019-11-07 01:13:42,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:13:42,085 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:13:42,086 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:13:42,086 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:13:42,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736095118] [2019-11-07 01:13:42,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:13:42,089 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:13:42,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:13:42,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:13:42,089 INFO L87 Difference]: Start difference. First operand 5119 states and 6316 transitions. Second operand 6 states. [2019-11-07 01:13:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:13:42,334 INFO L93 Difference]: Finished difference Result 5622 states and 6950 transitions. [2019-11-07 01:13:42,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:13:42,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 609 [2019-11-07 01:13:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:13:42,336 INFO L225 Difference]: With dead ends: 5622 [2019-11-07 01:13:42,336 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 01:13:42,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1219 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:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 01:13:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 01:13:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 01:13:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 01:13:42,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2019-11-07 01:13:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:13:42,343 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 01:13:42,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:13:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 01:13:42,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 01:13:42,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:13:42,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 01:13:43,619 WARN L191 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 610 DAG size of output: 138 [2019-11-07 01:13:44,238 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2019-11-07 01:13:45,500 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2019-11-07 01:13:45,836 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2019-11-07 01:13:46,024 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-11-07 01:13:46,145 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-07 01:13:46,302 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-11-07 01:13:46,530 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-07 01:13:46,670 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-11-07 01:13:46,821 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-11-07 01:13:46,824 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 01:13:46,825 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:13:46,825 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-11-07 01:13:46,825 INFO L443 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-11-07 01:13:46,825 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-11-07 01:13:46,825 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-11-07 01:13:46,825 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-11-07 01:13:46,825 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-11-07 01:13:46,826 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-11-07 01:13:46,826 INFO L443 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-11-07 01:13:46,826 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-11-07 01:13:46,826 INFO L443 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-11-07 01:13:46,826 INFO L439 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-11-07 01:13:46,827 INFO L439 ceAbstractionStarter]: At program point L170(lines 166 541) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1 .cse3))) [2019-11-07 01:13:46,827 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-11-07 01:13:46,827 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-11-07 01:13:46,827 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-11-07 01:13:46,827 INFO L443 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-11-07 01:13:46,827 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-11-07 01:13:46,827 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-11-07 01:13:46,828 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-11-07 01:13:46,828 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-11-07 01:13:46,828 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-11-07 01:13:46,828 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-11-07 01:13:46,828 INFO L439 ceAbstractionStarter]: At program point L140(lines 136 551) 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 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-07 01:13:46,829 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-07 01:13:46,829 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-11-07 01:13:46,829 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-07 01:13:46,829 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-11-07 01:13:46,829 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-11-07 01:13:46,829 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-11-07 01:13:46,830 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-11-07 01:13:46,830 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-11-07 01:13:46,830 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-11-07 01:13:46,830 INFO L443 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-11-07 01:13:46,830 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-11-07 01:13:46,830 INFO L439 ceAbstractionStarter]: At program point L176(lines 172 539) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1 .cse3))) [2019-11-07 01:13:46,831 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-07 01:13:46,831 INFO L443 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-07 01:13:46,831 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-11-07 01:13:46,831 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-11-07 01:13:46,831 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-11-07 01:13:46,831 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-11-07 01:13:46,831 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-07 01:13:46,831 INFO L443 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-11-07 01:13:46,832 INFO L439 ceAbstractionStarter]: At program point L146(lines 142 549) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3))) [2019-11-07 01:13:46,832 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-11-07 01:13:46,832 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-07 01:13:46,832 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-11-07 01:13:46,832 INFO L439 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-11-07 01:13:46,832 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-11-07 01:13:46,832 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-11-07 01:13:46,833 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-11-07 01:13:46,833 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-11-07 01:13:46,833 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-07 01:13:46,833 INFO L443 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-07 01:13:46,833 INFO L439 ceAbstractionStarter]: At program point L182(lines 178 537) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3))) [2019-11-07 01:13:46,833 INFO L439 ceAbstractionStarter]: At program point L116(lines 112 559) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (< ssl3_connect_~s__state~0 4400) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0)))) [2019-11-07 01:13:46,833 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 609) the Hoare annotation is: true [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-11-07 01:13:46,834 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-11-07 01:13:46,835 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-07 01:13:46,835 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-11-07 01:13:46,835 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-11-07 01:13:46,835 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-11-07 01:13:46,835 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-11-07 01:13:46,835 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-11-07 01:13:46,835 INFO L439 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 (not .cse5)) (and .cse1 .cse2 .cse5 .cse3 .cse4 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)))) [2019-11-07 01:13:46,836 INFO L439 ceAbstractionStarter]: At program point L122(lines 118 557) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (< ssl3_connect_~s__state~0 4400) (< 4368 ssl3_connect_~s__state~0))) [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-11-07 01:13:46,836 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-07 01:13:46,837 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-11-07 01:13:46,837 INFO L439 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse2 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ssl3_connect_~s__state~0)) (.cse4 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2 .cse3 (not .cse4)))) [2019-11-07 01:13:46,837 INFO L439 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1 .cse3))) [2019-11-07 01:13:46,837 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 609) no Hoare annotation was computed. [2019-11-07 01:13:46,837 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-11-07 01:13:46,837 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-11-07 01:13:46,837 INFO L443 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-11-07 01:13:46,838 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 609) no Hoare annotation was computed. [2019-11-07 01:13:46,838 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-11-07 01:13:46,838 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-11-07 01:13:46,838 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-11-07 01:13:46,838 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-11-07 01:13:46,838 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-07 01:13:46,838 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-11-07 01:13:46,838 INFO L446 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-11-07 01:13:46,839 INFO L439 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (< 4384 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (<= ssl3_connect_~blastFlag~0 4) .cse0 .cse1 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-07 01:13:46,839 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-07 01:13:46,839 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-07 01:13:46,839 INFO L443 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-11-07 01:13:46,839 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-11-07 01:13:46,839 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-11-07 01:13:46,839 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-11-07 01:13:46,839 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-11-07 01:13:46,839 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-11-07 01:13:46,840 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-11-07 01:13:46,840 INFO L443 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-11-07 01:13:46,840 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-11-07 01:13:46,840 INFO L439 ceAbstractionStarter]: At program point L164(lines 160 543) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3))) [2019-11-07 01:13:46,840 INFO L439 ceAbstractionStarter]: At program point L98(lines 97 564) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-11-07 01:13:46,840 INFO L439 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse2 (= 4448 ssl3_connect_~s__state~0)) (.cse11 (<= 4560 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~s__state~0 3)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse20 (= ssl3_connect_~s__state~0 4432)) (.cse4 (= ssl3_connect_~s__state~0 4512)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse17 (= 4400 ssl3_connect_~s__state~0)) (.cse19 (= 4416 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= 4352 ssl3_connect_~s__state~0)) (.cse12 (not .cse1)) (.cse16 (= ssl3_connect_~s__state~0 4480)) (.cse6 (= 4464 ssl3_connect_~s__state~0)) (.cse14 (<= ssl3_connect_~blastFlag~0 4)) (.cse3 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse5 (<= ssl3_connect_~blastFlag~0 2)) (.cse15 (= ssl3_connect_~s__state~0 4496))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse3) (and .cse5 .cse6 .cse1) (and .cse0 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse10 .cse5 .cse0) (and .cse10 .cse5 .cse1) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse5 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse3) (and .cse5 .cse1 .cse2) (and .cse5 .cse0 .cse11 .cse13 .cse9) (and .cse0 .cse6 .cse1 .cse3) (and .cse0 .cse15 .cse1 .cse3) (and .cse5 .cse0 .cse7 .cse8 .cse1 .cse9) (and .cse0 .cse1 .cse3 .cse16) (and .cse5 .cse17 .cse1) (and .cse0 .cse18 .cse1 .cse3) (and .cse18 .cse14 .cse1 .cse3) (and .cse4 .cse14 .cse1 .cse3) (and .cse15 .cse14 .cse1 .cse3) (and .cse14 .cse1 .cse3 .cse19) (and .cse5 (= 4384 ssl3_connect_~s__state~0)) (and .cse14 .cse1 .cse3 .cse16) (and .cse20 .cse14 .cse1 .cse3) (and .cse0 .cse11 .cse1 .cse13 .cse9 .cse3) (and .cse10 .cse0 .cse3) (and .cse5 .cse18) (and .cse5 .cse20 .cse1) (and .cse5 .cse4) (and .cse0 .cse14 .cse17 .cse1 .cse3) (and .cse5 .cse1 .cse19) (and .cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse7 .cse8 .cse12) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse1 .cse16) (and .cse6 .cse14 .cse1 .cse3) (and .cse5 .cse15 .cse1)))) [2019-11-07 01:13:46,841 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-11-07 01:13:46,841 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-11-07 01:13:46,841 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-11-07 01:13:46,841 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-07 01:13:46,841 INFO L446 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-11-07 01:13:46,841 INFO L439 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (< 4384 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 4) .cse0 .cse1 (<= (mod (+ ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse2))) [2019-11-07 01:13:46,841 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:13:46,842 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 01:13:46,842 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 01:13:46,842 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 01:13:46,842 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 610 620) the Hoare annotation is: true [2019-11-07 01:13:46,842 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 610 620) no Hoare annotation was computed. [2019-11-07 01:13:46,842 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 610 620) no Hoare annotation was computed. [2019-11-07 01:13:46,842 INFO L439 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (<= 12292 main_~s~0) [2019-11-07 01:13:46,842 INFO L443 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2019-11-07 01:13:46,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:13:46 BoogieIcfgContainer [2019-11-07 01:13:46,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 01:13:46,882 INFO L168 Benchmark]: Toolchain (without parser) took 28996.97 ms. Allocated memory was 142.6 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 99.9 MB in the beginning and 127.0 MB in the end (delta: -27.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-11-07 01:13:46,882 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 118.7 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:46,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.57 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 177.7 MB in the end (delta: -78.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:46,884 INFO L168 Benchmark]: Boogie Preprocessor took 60.02 ms. Allocated memory is still 200.8 MB. Free memory was 177.7 MB in the beginning and 175.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:46,884 INFO L168 Benchmark]: RCFGBuilder took 666.75 ms. Allocated memory is still 200.8 MB. Free memory was 174.7 MB in the beginning and 133.0 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. [2019-11-07 01:13:46,885 INFO L168 Benchmark]: TraceAbstraction took 27789.16 ms. Allocated memory was 200.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 133.0 MB in the beginning and 127.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-11-07 01:13:46,887 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.29 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 476.57 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 177.7 MB in the end (delta: -78.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.02 ms. Allocated memory is still 200.8 MB. Free memory was 177.7 MB in the beginning and 175.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 666.75 ms. Allocated memory is still 200.8 MB. Free memory was 174.7 MB in the beginning and 133.0 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27789.16 ms. Allocated memory was 200.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 133.0 MB in the beginning and 127.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((4432 <= s__state && blastFlag <= 2) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4384 < s__state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4384 < s__state) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && 4464 == s__state) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || (blastFlag <= 0 && s__state == 4368)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && s__hit == 0) && 4448 == s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state == 4480)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__state == 4528 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__state == 4512 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((s__state == 4496 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((blastFlag <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4416 == s__state)) || (blastFlag <= 2 && 4384 == s__state)) || (((blastFlag <= 4 && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state == 4480)) || (((s__state == 4432 && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || (blastFlag <= 2 && s__state == 4528)) || ((blastFlag <= 2 && s__state == 4432) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && s__hit == 0) && 4416 == s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || !(12292 <= \old(initial_state))) || ((blastFlag <= 2 && s__hit == 0) && s__state == 4480)) || (((4464 == s__state && blastFlag <= 4) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((blastFlag <= 2 && s__state == 4496) && s__hit == 0) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4384 < s__state)) || ((((blastFlag <= 4 && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4384 < s__state) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && 4560 <= s__state) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && s__state < 4400) && 4368 < s__state) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) || !(12292 <= \old(initial_state))) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (s__state < 4400 && blastFlag <= 0 && 4352 <= s__state) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) && s__hit == 0)) || ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0)) || ((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 132 locations, 1 error locations. Result: SAFE, OverallTime: 27.6s, OverallIterations: 28, TraceHistogramMax: 21, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, HoareTripleCheckerStatistics: 5656 SDtfs, 2288 SDslu, 3970 SDs, 0 SdLazy, 3251 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5836 GetRequests, 5778 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12568occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 7728 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 337 NumberOfFragments, 1154 HoareAnnotationTreeSize, 26 FomulaSimplifications, 42184 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 5142 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 9751 NumberOfCodeBlocks, 9498 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 12579 ConstructedInterpolants, 0 QuantifiedInterpolants, 7709493 SizeOfPredicates, 10 NumberOfNonLiveVariables, 4259 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 42 InterpolantComputations, 29 PerfectInterpolantSequences, 54385/54521 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...