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-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:37,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:37,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:37,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:37,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:37,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:37,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:37,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:37,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:37,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:37,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:37,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:37,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:37,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:37,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:37,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:37,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:37,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:37,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:37,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:37,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:37,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:37,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:37,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:37,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:37,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:37,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:37,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:37,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:37,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:37,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:37,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:37,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:37,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:37,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:37,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:37,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:37,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:37,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:37,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:37,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:37,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:27:37,860 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:37,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:37,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:37,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:37,864 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:37,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:37,865 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:37,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:37,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:37,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:37,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:37,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:37,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:37,867 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:37,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:37,868 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:37,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:37,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:37,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:37,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:37,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:37,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:37,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:37,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:37,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:37,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:37,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:37,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:37,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:27:38,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:38,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:38,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:38,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:38,160 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:38,161 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-3.c [2019-10-15 01:27:38,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3131aedf/7d45879da4b640d7a4a938a5f2c066be/FLAGb5859b57a [2019-10-15 01:27:38,700 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:27:38,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-10-15 01:27:38,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3131aedf/7d45879da4b640d7a4a938a5f2c066be/FLAGb5859b57a [2019-10-15 01:27:38,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3131aedf/7d45879da4b640d7a4a938a5f2c066be [2019-10-15 01:27:38,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:27:38,746 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:27:38,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:38,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:27:38,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:27:38,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f900208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:38, skipping insertion in model container [2019-10-15 01:27:38,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:38" (1/1) ... [2019-10-15 01:27:38,762 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:27:38,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:27:39,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:39,065 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:27:39,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:39,223 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:27:39,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39 WrapperNode [2019-10-15 01:27:39,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:39,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:27:39,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:27:39,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:27:39,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... [2019-10-15 01:27:39,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:27:39,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:27:39,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:27:39,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:27:39,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:27:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:27:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-15 01:27:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:27:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:27:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:27:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:27:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:27:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:27:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-15 01:27:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:27:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:27:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:27:39,555 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:27:40,063 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-15 01:27:40,063 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-15 01:27:40,077 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:27:40,077 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:27:40,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:40 BoogieIcfgContainer [2019-10-15 01:27:40,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:27:40,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:27:40,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:27:40,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:27:40,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:27:38" (1/3) ... [2019-10-15 01:27:40,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16597854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:40, skipping insertion in model container [2019-10-15 01:27:40,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:39" (2/3) ... [2019-10-15 01:27:40,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16597854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:40, skipping insertion in model container [2019-10-15 01:27:40,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:40" (3/3) ... [2019-10-15 01:27:40,087 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-10-15 01:27:40,096 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:27:40,104 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:27:40,115 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:27:40,141 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:27:40,141 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:27:40,141 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:27:40,142 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:27:40,142 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:27:40,142 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:27:40,142 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:27:40,142 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:27:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-10-15 01:27:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:27:40,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,173 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:40,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,181 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-10-15 01:27:40,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744844988] [2019-10-15 01:27:40,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:40,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744844988] [2019-10-15 01:27:40,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955382341] [2019-10-15 01:27:40,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,412 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-10-15 01:27:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:40,518 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-10-15 01:27:40,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:40,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 01:27:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:40,534 INFO L225 Difference]: With dead ends: 377 [2019-10-15 01:27:40,535 INFO L226 Difference]: Without dead ends: 220 [2019-10-15 01:27:40,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-15 01:27:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-10-15 01:27:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-15 01:27:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-10-15 01:27:40,601 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-10-15 01:27:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:40,602 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-10-15 01:27:40,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-10-15 01:27:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:27:40,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:40,606 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:40,607 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2019-10-15 01:27:40,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:40,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224963167] [2019-10-15 01:27:40,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:40,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:40,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224963167] [2019-10-15 01:27:40,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:40,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:40,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704558838] [2019-10-15 01:27:40,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:40,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,768 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-10-15 01:27:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:40,960 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2019-10-15 01:27:40,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:40,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 01:27:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:40,963 INFO L225 Difference]: With dead ends: 472 [2019-10-15 01:27:40,964 INFO L226 Difference]: Without dead ends: 264 [2019-10-15 01:27:40,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-15 01:27:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2019-10-15 01:27:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-15 01:27:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-10-15 01:27:41,003 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-10-15 01:27:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,003 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-10-15 01:27:41,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-10-15 01:27:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:41,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,009 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,009 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1571737336, now seen corresponding path program 1 times [2019-10-15 01:27:41,011 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896451930] [2019-10-15 01:27:41,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:41,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896451930] [2019-10-15 01:27:41,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869145774] [2019-10-15 01:27:41,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,119 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-10-15 01:27:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,307 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-10-15 01:27:41,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,310 INFO L225 Difference]: With dead ends: 598 [2019-10-15 01:27:41,310 INFO L226 Difference]: Without dead ends: 354 [2019-10-15 01:27:41,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-15 01:27:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-10-15 01:27:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-15 01:27:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-10-15 01:27:41,329 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-10-15 01:27:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,330 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-10-15 01:27:41,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-10-15 01:27:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:27:41,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,333 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,333 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,334 INFO L82 PathProgramCache]: Analyzing trace with hash -233700998, now seen corresponding path program 1 times [2019-10-15 01:27:41,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236435894] [2019-10-15 01:27:41,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:41,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236435894] [2019-10-15 01:27:41,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644211656] [2019-10-15 01:27:41,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,396 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-10-15 01:27:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,551 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-10-15 01:27:41,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:27:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,555 INFO L225 Difference]: With dead ends: 708 [2019-10-15 01:27:41,555 INFO L226 Difference]: Without dead ends: 384 [2019-10-15 01:27:41,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-15 01:27:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-10-15 01:27:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-15 01:27:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-10-15 01:27:41,573 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-10-15 01:27:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,574 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-10-15 01:27:41,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-10-15 01:27:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 01:27:41,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,577 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,578 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash -343872958, now seen corresponding path program 1 times [2019-10-15 01:27:41,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984302309] [2019-10-15 01:27:41,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:27:41,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984302309] [2019-10-15 01:27:41,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143223094] [2019-10-15 01:27:41,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,698 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-10-15 01:27:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:41,871 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-10-15 01:27:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:41,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-15 01:27:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:41,875 INFO L225 Difference]: With dead ends: 842 [2019-10-15 01:27:41,875 INFO L226 Difference]: Without dead ends: 478 [2019-10-15 01:27:41,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-15 01:27:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-10-15 01:27:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-15 01:27:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-10-15 01:27:41,892 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-10-15 01:27:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:41,892 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-10-15 01:27:41,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-10-15 01:27:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:27:41,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:41,895 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:41,895 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1570407527, now seen corresponding path program 1 times [2019-10-15 01:27:41,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:41,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819747489] [2019-10-15 01:27:41,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:41,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-15 01:27:41,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819747489] [2019-10-15 01:27:41,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:41,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:41,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649393301] [2019-10-15 01:27:41,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:41,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:41,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:41,968 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-10-15 01:27:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,116 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-10-15 01:27:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-15 01:27:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,119 INFO L225 Difference]: With dead ends: 940 [2019-10-15 01:27:42,120 INFO L226 Difference]: Without dead ends: 500 [2019-10-15 01:27:42,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-15 01:27:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-10-15 01:27:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-15 01:27:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-10-15 01:27:42,136 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-10-15 01:27:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,137 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-10-15 01:27:42,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-10-15 01:27:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:27:42,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,139 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1356861727, now seen corresponding path program 1 times [2019-10-15 01:27:42,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232464519] [2019-10-15 01:27:42,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:27:42,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232464519] [2019-10-15 01:27:42,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776411905] [2019-10-15 01:27:42,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,205 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-10-15 01:27:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,246 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-10-15 01:27:42,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:27:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,252 INFO L225 Difference]: With dead ends: 976 [2019-10-15 01:27:42,252 INFO L226 Difference]: Without dead ends: 734 [2019-10-15 01:27:42,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-15 01:27:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-10-15 01:27:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-10-15 01:27:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-10-15 01:27:42,278 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-10-15 01:27:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,278 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-10-15 01:27:42,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-10-15 01:27:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:27:42,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,286 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,287 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1774863991, now seen corresponding path program 1 times [2019-10-15 01:27:42,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733250015] [2019-10-15 01:27:42,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-15 01:27:42,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733250015] [2019-10-15 01:27:42,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203093419] [2019-10-15 01:27:42,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,371 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-10-15 01:27:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,411 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-10-15 01:27:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-15 01:27:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,417 INFO L225 Difference]: With dead ends: 976 [2019-10-15 01:27:42,417 INFO L226 Difference]: Without dead ends: 974 [2019-10-15 01:27:42,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-15 01:27:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-10-15 01:27:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-15 01:27:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-10-15 01:27:42,444 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-10-15 01:27:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,445 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-10-15 01:27:42,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-10-15 01:27:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:27:42,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,448 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,449 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash 600728947, now seen corresponding path program 1 times [2019-10-15 01:27:42,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995649082] [2019-10-15 01:27:42,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-15 01:27:42,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995649082] [2019-10-15 01:27:42,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142207854] [2019-10-15 01:27:42,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,502 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-10-15 01:27:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,677 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-10-15 01:27:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-15 01:27:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,685 INFO L225 Difference]: With dead ends: 2140 [2019-10-15 01:27:42,685 INFO L226 Difference]: Without dead ends: 1170 [2019-10-15 01:27:42,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-10-15 01:27:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-10-15 01:27:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-15 01:27:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-10-15 01:27:42,716 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 154 [2019-10-15 01:27:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,717 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-10-15 01:27:42,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-10-15 01:27:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-15 01:27:42,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,721 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,721 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1176011842, now seen corresponding path program 1 times [2019-10-15 01:27:42,722 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592119337] [2019-10-15 01:27:42,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-15 01:27:42,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592119337] [2019-10-15 01:27:42,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:42,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:42,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335777318] [2019-10-15 01:27:42,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:42,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,800 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-10-15 01:27:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:42,925 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-10-15 01:27:42,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:42,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-15 01:27:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:42,931 INFO L225 Difference]: With dead ends: 2354 [2019-10-15 01:27:42,932 INFO L226 Difference]: Without dead ends: 1236 [2019-10-15 01:27:42,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-10-15 01:27:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-10-15 01:27:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-15 01:27:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-10-15 01:27:42,976 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 190 [2019-10-15 01:27:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:42,976 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-10-15 01:27:42,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-10-15 01:27:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-15 01:27:42,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:42,984 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:42,984 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:42,985 INFO L82 PathProgramCache]: Analyzing trace with hash -717257595, now seen corresponding path program 1 times [2019-10-15 01:27:42,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:42,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198268400] [2019-10-15 01:27:42,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:42,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-15 01:27:43,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198268400] [2019-10-15 01:27:43,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479332224] [2019-10-15 01:27:43,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,076 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-10-15 01:27:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,256 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-10-15 01:27:43,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-10-15 01:27:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,264 INFO L225 Difference]: With dead ends: 2544 [2019-10-15 01:27:43,264 INFO L226 Difference]: Without dead ends: 1334 [2019-10-15 01:27:43,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-10-15 01:27:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-10-15 01:27:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-15 01:27:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-10-15 01:27:43,300 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 211 [2019-10-15 01:27:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,301 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-10-15 01:27:43,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-10-15 01:27:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-15 01:27:43,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,306 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:43,306 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1079909240, now seen corresponding path program 1 times [2019-10-15 01:27:43,307 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462040363] [2019-10-15 01:27:43,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-15 01:27:43,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462040363] [2019-10-15 01:27:43,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527436624] [2019-10-15 01:27:43,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,399 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-10-15 01:27:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,535 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-10-15 01:27:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-15 01:27:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,542 INFO L225 Difference]: With dead ends: 2752 [2019-10-15 01:27:43,543 INFO L226 Difference]: Without dead ends: 1442 [2019-10-15 01:27:43,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-10-15 01:27:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-10-15 01:27:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-15 01:27:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-10-15 01:27:43,580 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 235 [2019-10-15 01:27:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,581 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-10-15 01:27:43,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-10-15 01:27:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-15 01:27:43,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,586 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:43,587 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1213171786, now seen corresponding path program 1 times [2019-10-15 01:27:43,587 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894273266] [2019-10-15 01:27:43,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-15 01:27:43,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894273266] [2019-10-15 01:27:43,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:43,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:43,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273674989] [2019-10-15 01:27:43,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:43,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:43,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,713 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-10-15 01:27:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:43,910 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-10-15 01:27:43,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:43,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-15 01:27:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:43,921 INFO L225 Difference]: With dead ends: 2992 [2019-10-15 01:27:43,922 INFO L226 Difference]: Without dead ends: 1570 [2019-10-15 01:27:43,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-15 01:27:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-10-15 01:27:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-10-15 01:27:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-10-15 01:27:43,983 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 235 [2019-10-15 01:27:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:43,984 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-10-15 01:27:43,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-10-15 01:27:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-15 01:27:43,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:43,995 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:43,995 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:43,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1569112328, now seen corresponding path program 1 times [2019-10-15 01:27:43,996 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:43,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698717560] [2019-10-15 01:27:43,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:43,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-15 01:27:44,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698717560] [2019-10-15 01:27:44,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161735056] [2019-10-15 01:27:44,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,162 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-10-15 01:27:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,217 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-10-15 01:27:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-10-15 01:27:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,233 INFO L225 Difference]: With dead ends: 4646 [2019-10-15 01:27:44,233 INFO L226 Difference]: Without dead ends: 3100 [2019-10-15 01:27:44,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-10-15 01:27:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-10-15 01:27:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-10-15 01:27:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-10-15 01:27:44,309 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 265 [2019-10-15 01:27:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,310 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-10-15 01:27:44,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-10-15 01:27:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-15 01:27:44,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,318 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:44,319 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash 432773942, now seen corresponding path program 1 times [2019-10-15 01:27:44,319 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884259199] [2019-10-15 01:27:44,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-15 01:27:44,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884259199] [2019-10-15 01:27:44,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224892443] [2019-10-15 01:27:44,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,405 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-10-15 01:27:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:44,567 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-10-15 01:27:44,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:44,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-10-15 01:27:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:44,584 INFO L225 Difference]: With dead ends: 6484 [2019-10-15 01:27:44,584 INFO L226 Difference]: Without dead ends: 3398 [2019-10-15 01:27:44,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-15 01:27:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-10-15 01:27:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-10-15 01:27:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-10-15 01:27:44,717 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 265 [2019-10-15 01:27:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:44,717 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-10-15 01:27:44,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-10-15 01:27:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-15 01:27:44,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:44,733 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:44,733 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash -764797682, now seen corresponding path program 1 times [2019-10-15 01:27:44,734 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:44,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201000577] [2019-10-15 01:27:44,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:44,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-10-15 01:27:44,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201000577] [2019-10-15 01:27:44,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:44,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:44,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199728837] [2019-10-15 01:27:44,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:44,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:44,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:44,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:44,877 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-10-15 01:27:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:45,103 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-10-15 01:27:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:45,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-10-15 01:27:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:45,119 INFO L225 Difference]: With dead ends: 6900 [2019-10-15 01:27:45,119 INFO L226 Difference]: Without dead ends: 3530 [2019-10-15 01:27:45,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-10-15 01:27:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-10-15 01:27:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-10-15 01:27:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-10-15 01:27:45,214 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 289 [2019-10-15 01:27:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:45,214 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-10-15 01:27:45,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-10-15 01:27:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-15 01:27:45,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:45,229 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:45,230 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2053251468, now seen corresponding path program 1 times [2019-10-15 01:27:45,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:45,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943698286] [2019-10-15 01:27:45,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-15 01:27:45,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943698286] [2019-10-15 01:27:45,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:45,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:45,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878933312] [2019-10-15 01:27:45,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:45,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:45,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:45,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,404 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-10-15 01:27:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:45,575 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-10-15 01:27:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:45,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-15 01:27:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:45,592 INFO L225 Difference]: With dead ends: 7416 [2019-10-15 01:27:45,593 INFO L226 Difference]: Without dead ends: 3914 [2019-10-15 01:27:45,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-10-15 01:27:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-10-15 01:27:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-10-15 01:27:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-10-15 01:27:45,680 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 300 [2019-10-15 01:27:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:45,680 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-10-15 01:27:45,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-10-15 01:27:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-15 01:27:45,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:45,691 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:45,691 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash 816481962, now seen corresponding path program 1 times [2019-10-15 01:27:45,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:45,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373562187] [2019-10-15 01:27:45,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:45,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-15 01:27:45,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373562187] [2019-10-15 01:27:45,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:45,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:45,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735005039] [2019-10-15 01:27:45,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:45,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:45,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:45,842 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-10-15 01:27:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:46,080 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-10-15 01:27:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:46,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-15 01:27:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:46,126 INFO L225 Difference]: With dead ends: 8048 [2019-10-15 01:27:46,126 INFO L226 Difference]: Without dead ends: 4234 [2019-10-15 01:27:46,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-10-15 01:27:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-10-15 01:27:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-10-15 01:27:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-10-15 01:27:46,230 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 314 [2019-10-15 01:27:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:46,231 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-10-15 01:27:46,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-10-15 01:27:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-15 01:27:46,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:46,241 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:46,242 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1006853977, now seen corresponding path program 1 times [2019-10-15 01:27:46,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:46,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382844302] [2019-10-15 01:27:46,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-15 01:27:46,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382844302] [2019-10-15 01:27:46,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:46,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:46,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031491600] [2019-10-15 01:27:46,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:46,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:46,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,385 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-10-15 01:27:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:46,470 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-10-15 01:27:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:46,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-10-15 01:27:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:46,487 INFO L225 Difference]: With dead ends: 11310 [2019-10-15 01:27:46,487 INFO L226 Difference]: Without dead ends: 7376 [2019-10-15 01:27:46,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-10-15 01:27:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-10-15 01:27:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-10-15 01:27:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-10-15 01:27:46,700 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 315 [2019-10-15 01:27:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:46,701 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-10-15 01:27:46,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-10-15 01:27:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-15 01:27:46,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:46,718 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:46,718 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash 999089455, now seen corresponding path program 1 times [2019-10-15 01:27:46,719 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:46,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643330357] [2019-10-15 01:27:46,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-15 01:27:46,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643330357] [2019-10-15 01:27:46,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:46,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:46,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847483867] [2019-10-15 01:27:46,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:46,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:46,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:46,880 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-10-15 01:27:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:47,084 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-10-15 01:27:47,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:47,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-10-15 01:27:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:47,099 INFO L225 Difference]: With dead ends: 14744 [2019-10-15 01:27:47,100 INFO L226 Difference]: Without dead ends: 7382 [2019-10-15 01:27:47,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-10-15 01:27:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-10-15 01:27:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-10-15 01:27:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-10-15 01:27:47,252 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 316 [2019-10-15 01:27:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:47,252 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-10-15 01:27:47,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-10-15 01:27:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-15 01:27:47,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:47,271 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:47,271 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:47,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:47,271 INFO L82 PathProgramCache]: Analyzing trace with hash -901585188, now seen corresponding path program 1 times [2019-10-15 01:27:47,271 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:47,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317913940] [2019-10-15 01:27:47,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 766 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-15 01:27:47,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317913940] [2019-10-15 01:27:47,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505492656] [2019-10-15 01:27:47,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:47,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:27:47,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2019-10-15 01:27:47,715 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2019-10-15 01:27:47,912 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:47,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2019-10-15 01:27:47,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217600607] [2019-10-15 01:27:47,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:27:47,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:27:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:27:47,914 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 8 states. [2019-10-15 01:27:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:48,417 INFO L93 Difference]: Finished difference Result 14914 states and 19435 transitions. [2019-10-15 01:27:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:27:48,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 339 [2019-10-15 01:27:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:48,439 INFO L225 Difference]: With dead ends: 14914 [2019-10-15 01:27:48,439 INFO L226 Difference]: Without dead ends: 7548 [2019-10-15 01:27:48,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 673 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-10-15 01:27:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2019-10-15 01:27:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 7356. [2019-10-15 01:27:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-10-15 01:27:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-10-15 01:27:48,681 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 339 [2019-10-15 01:27:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:48,681 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-10-15 01:27:48,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:27:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-10-15 01:27:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-15 01:27:48,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:48,708 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:48,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:48,912 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash 998396082, now seen corresponding path program 1 times [2019-10-15 01:27:48,913 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:48,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963821187] [2019-10-15 01:27:48,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-15 01:27:49,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963821187] [2019-10-15 01:27:49,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006732324] [2019-10-15 01:27:49,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:49,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-15 01:27:49,544 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-15 01:27:49,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1897803641] [2019-10-15 01:27:49,652 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 353 [2019-10-15 01:27:49,726 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:49,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:49,882 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:27:53,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:53,346 INFO L272 AbstractInterpreter]: Visited 111 different actions 2288 times. Merged at 100 different actions 1842 times. Widened at 20 different actions 223 times. Performed 6021 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6021 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 325 fixpoints after 42 different actions. Largest state had 116 variables. [2019-10-15 01:27:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:53,352 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:53,352 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:53,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:53,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674314926] [2019-10-15 01:27:53,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:53,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:53,355 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 6 states. [2019-10-15 01:27:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:54,312 INFO L93 Difference]: Finished difference Result 14744 states and 19201 transitions. [2019-10-15 01:27:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:27:54,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 352 [2019-10-15 01:27:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:54,341 INFO L225 Difference]: With dead ends: 14744 [2019-10-15 01:27:54,342 INFO L226 Difference]: Without dead ends: 11154 [2019-10-15 01:27:54,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:27:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11154 states. [2019-10-15 01:27:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11154 to 8460. [2019-10-15 01:27:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-10-15 01:27:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-10-15 01:27:54,618 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 352 [2019-10-15 01:27:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:54,619 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-10-15 01:27:54,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-10-15 01:27:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-15 01:27:54,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:54,636 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:54,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:54,843 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:54,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2002133556, now seen corresponding path program 2 times [2019-10-15 01:27:54,844 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:54,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381644166] [2019-10-15 01:27:54,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-15 01:27:55,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381644166] [2019-10-15 01:27:55,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868339940] [2019-10-15 01:27:55,083 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:55,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-15 01:27:55,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:27:55,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:55,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-10-15 01:27:55,256 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-10-15 01:27:55,362 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:55,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:27:55,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244301773] [2019-10-15 01:27:55,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:55,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:55,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:55,365 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 3 states. [2019-10-15 01:27:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,558 INFO L93 Difference]: Finished difference Result 16374 states and 21042 transitions. [2019-10-15 01:27:55,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:55,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-15 01:27:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,572 INFO L225 Difference]: With dead ends: 16374 [2019-10-15 01:27:55,572 INFO L226 Difference]: Without dead ends: 7932 [2019-10-15 01:27:55,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2019-10-15 01:27:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7684. [2019-10-15 01:27:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-10-15 01:27:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 9645 transitions. [2019-10-15 01:27:55,811 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 9645 transitions. Word has length 365 [2019-10-15 01:27:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,812 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 9645 transitions. [2019-10-15 01:27:55,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 9645 transitions. [2019-10-15 01:27:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-15 01:27:55,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,827 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:56,032 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash 776946245, now seen corresponding path program 1 times [2019-10-15 01:27:56,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424542309] [2019-10-15 01:27:56,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:56,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424542309] [2019-10-15 01:27:56,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171129280] [2019-10-15 01:27:56,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:56,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:56,565 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-15 01:27:56,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [803920968] [2019-10-15 01:27:56,664 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 380 [2019-10-15 01:27:56,672 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:27:56,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:27:56,691 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:27:58,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:27:58,921 INFO L272 AbstractInterpreter]: Visited 112 different actions 2377 times. Merged at 101 different actions 1907 times. Widened at 21 different actions 228 times. Performed 6378 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6378 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 346 fixpoints after 43 different actions. Largest state had 116 variables. [2019-10-15 01:27:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,921 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:27:58,922 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:27:58,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:27:58,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503430765] [2019-10-15 01:27:58,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:27:58,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:58,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:27:58,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:27:58,927 INFO L87 Difference]: Start difference. First operand 7684 states and 9645 transitions. Second operand 6 states. [2019-10-15 01:27:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:59,530 INFO L93 Difference]: Finished difference Result 17152 states and 21441 transitions. [2019-10-15 01:27:59,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:59,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 379 [2019-10-15 01:27:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:59,558 INFO L225 Difference]: With dead ends: 17152 [2019-10-15 01:27:59,558 INFO L226 Difference]: Without dead ends: 9478 [2019-10-15 01:27:59,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:27:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2019-10-15 01:27:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7985. [2019-10-15 01:27:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2019-10-15 01:27:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9973 transitions. [2019-10-15 01:27:59,799 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9973 transitions. Word has length 379 [2019-10-15 01:27:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:59,800 INFO L462 AbstractCegarLoop]: Abstraction has 7985 states and 9973 transitions. [2019-10-15 01:27:59,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:27:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9973 transitions. [2019-10-15 01:27:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-15 01:27:59,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:59,834 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:00,047 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash -885260259, now seen corresponding path program 1 times [2019-10-15 01:28:00,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786987203] [2019-10-15 01:28:00,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-15 01:28:00,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786987203] [2019-10-15 01:28:00,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:00,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:00,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649861536] [2019-10-15 01:28:00,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:00,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:00,425 INFO L87 Difference]: Start difference. First operand 7985 states and 9973 transitions. Second operand 3 states. [2019-10-15 01:28:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:00,668 INFO L93 Difference]: Finished difference Result 15351 states and 18826 transitions. [2019-10-15 01:28:00,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:00,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-15 01:28:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:00,677 INFO L225 Difference]: With dead ends: 15351 [2019-10-15 01:28:00,677 INFO L226 Difference]: Without dead ends: 3759 [2019-10-15 01:28:00,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2019-10-15 01:28:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3524. [2019-10-15 01:28:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-10-15 01:28:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4353 transitions. [2019-10-15 01:28:00,753 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4353 transitions. Word has length 418 [2019-10-15 01:28:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:00,754 INFO L462 AbstractCegarLoop]: Abstraction has 3524 states and 4353 transitions. [2019-10-15 01:28:00,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4353 transitions. [2019-10-15 01:28:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-10-15 01:28:00,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:00,781 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,782 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1596843861, now seen corresponding path program 1 times [2019-10-15 01:28:00,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316926268] [2019-10-15 01:28:00,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-10-15 01:28:01,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316926268] [2019-10-15 01:28:01,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87490903] [2019-10-15 01:28:01,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:01,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-10-15 01:28:01,580 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-10-15 01:28:01,840 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:01,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:01,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777978263] [2019-10-15 01:28:01,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:01,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:01,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:01,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:01,843 INFO L87 Difference]: Start difference. First operand 3524 states and 4353 transitions. Second operand 3 states. [2019-10-15 01:28:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:01,880 INFO L93 Difference]: Finished difference Result 3600 states and 4449 transitions. [2019-10-15 01:28:01,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:01,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-10-15 01:28:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:01,887 INFO L225 Difference]: With dead ends: 3600 [2019-10-15 01:28:01,887 INFO L226 Difference]: Without dead ends: 3523 [2019-10-15 01:28:01,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1007 GetRequests, 1004 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2019-10-15 01:28:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 3449. [2019-10-15 01:28:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2019-10-15 01:28:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4260 transitions. [2019-10-15 01:28:01,941 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4260 transitions. Word has length 502 [2019-10-15 01:28:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:01,942 INFO L462 AbstractCegarLoop]: Abstraction has 3449 states and 4260 transitions. [2019-10-15 01:28:01,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4260 transitions. [2019-10-15 01:28:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2019-10-15 01:28:01,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:01,957 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2019-10-15 01:28:02,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:02,164 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:02,165 INFO L82 PathProgramCache]: Analyzing trace with hash -234514290, now seen corresponding path program 1 times [2019-10-15 01:28:02,165 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:02,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769258216] [2019-10-15 01:28:02,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:02,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-10-15 01:28:02,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769258216] [2019-10-15 01:28:02,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712400325] [2019-10-15 01:28:02,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:02,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:02,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-10-15 01:28:02,923 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-10-15 01:28:03,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [730268282] [2019-10-15 01:28:03,201 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 615 [2019-10-15 01:28:03,208 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:03,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:03,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:04,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:04,702 INFO L272 AbstractInterpreter]: Visited 115 different actions 2077 times. Merged at 100 different actions 1692 times. Widened at 19 different actions 222 times. Performed 5555 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5555 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 260 fixpoints after 25 different actions. Largest state had 117 variables. [2019-10-15 01:28:04,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,703 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:04,703 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:04,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:04,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738636004] [2019-10-15 01:28:04,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:04,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:04,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:04,706 INFO L87 Difference]: Start difference. First operand 3449 states and 4260 transitions. Second operand 6 states. [2019-10-15 01:28:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,954 INFO L93 Difference]: Finished difference Result 3956 states and 4898 transitions. [2019-10-15 01:28:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:04,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 614 [2019-10-15 01:28:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,956 INFO L225 Difference]: With dead ends: 3956 [2019-10-15 01:28:04,956 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:04,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1229 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:04,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 614 [2019-10-15 01:28:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,962 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:04,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:04,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:05,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:05,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:06,170 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 426 DAG size of output: 108 [2019-10-15 01:28:07,088 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-10-15 01:28:07,841 WARN L191 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-10-15 01:28:07,846 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:28:07,846 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:28:07,846 INFO L446 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2019-10-15 01:28:07,846 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2019-10-15 01:28:07,846 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2019-10-15 01:28:07,846 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2019-10-15 01:28:07,846 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2019-10-15 01:28:07,847 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 (not .cse2)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse2 .cse1 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2019-10-15 01:28:07,847 INFO L439 ceAbstractionStarter]: At program point L136(lines 132 537) 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-10-15 01:28:07,847 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-10-15 01:28:07,847 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2019-10-15 01:28:07,847 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2019-10-15 01:28:07,847 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2019-10-15 01:28:07,847 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2019-10-15 01:28:07,848 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2019-10-15 01:28:07,848 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2019-10-15 01:28:07,848 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2019-10-15 01:28:07,848 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-10-15 01:28:07,848 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2019-10-15 01:28:07,848 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2019-10-15 01:28:07,848 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2019-10-15 01:28:07,848 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2019-10-15 01:28:07,849 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2019-10-15 01:28:07,849 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-10-15 01:28:07,849 INFO L439 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1))) [2019-10-15 01:28:07,849 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2019-10-15 01:28:07,849 INFO L443 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2019-10-15 01:28:07,849 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-10-15 01:28:07,849 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-10-15 01:28:07,850 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2019-10-15 01:28:07,850 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2019-10-15 01:28:07,850 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2019-10-15 01:28:07,850 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2019-10-15 01:28:07,850 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2019-10-15 01:28:07,850 INFO L446 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2019-10-15 01:28:07,850 INFO L439 ceAbstractionStarter]: At program point L142(lines 138 535) 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_~s__s3__tmp__next_state___0~0 4560) (<= ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2))) [2019-10-15 01:28:07,851 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-15 01:28:07,851 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2019-10-15 01:28:07,851 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2019-10-15 01:28:07,851 INFO L446 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2019-10-15 01:28:07,851 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2019-10-15 01:28:07,851 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2019-10-15 01:28:07,851 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2019-10-15 01:28:07,851 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2019-10-15 01:28:07,852 INFO L443 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2019-10-15 01:28:07,852 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 523) 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2019-10-15 01:28:07,852 INFO L439 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-10-15 01:28:07,852 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2019-10-15 01:28:07,852 INFO L439 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse3 (= 4448 ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse6 (<= ssl3_connect_~s__state~0 3)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse7 (= ssl3_connect_~s__state~0 4480)) (.cse12 (not .cse2)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse17 (= 4464 ssl3_connect_~s__state~0)) (.cse14 (= ssl3_connect_~s__state~0 4496)) (.cse1 (<= ssl3_connect_~blastFlag~0 4)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (= ssl3_connect_~s__state~0 4512)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse8 (= 4400 ssl3_connect_~s__state~0))) (or (and .cse0 (= 4384 ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2) (and (= ssl3_connect_~s__state~0 4432) .cse1 .cse2) (and .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse2) (and .cse1 .cse2 .cse7) (and .cse5 .cse1 .cse8 .cse2) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse5 .cse9 .cse2 .cse10 .cse11) (and .cse0 .cse9 .cse12 .cse10) (and .cse13 .cse1 .cse2) (and .cse6 .cse5) (and .cse5 .cse13 .cse2) (and .cse5 .cse14 .cse2) (and .cse0 .cse13) (and .cse0 .cse4) (and .cse1 .cse2 (= 4416 ssl3_connect_~s__state~0)) (and .cse5 .cse2 .cse7) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse15 .cse16 .cse12) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse17 .cse1 .cse2) (and .cse5 .cse15 .cse16 .cse2 .cse11) (and .cse5 .cse17 .cse2) (and .cse14 .cse1 .cse2) (and .cse5 .cse4 .cse2) (and .cse0 .cse8 .cse2)))) [2019-10-15 01:28:07,852 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L439 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L439 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (< 4384 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-10-15 01:28:07,853 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2019-10-15 01:28:07,854 INFO L443 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2019-10-15 01:28:07,854 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2019-10-15 01:28:07,854 INFO L439 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-10-15 01:28:07,854 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2019-10-15 01:28:07,854 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2019-10-15 01:28:07,854 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2019-10-15 01:28:07,854 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2019-10-15 01:28:07,854 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2019-10-15 01:28:07,854 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 521) 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L439 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2019-10-15 01:28:07,855 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2019-10-15 01:28:07,856 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2019-10-15 01:28:07,856 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2019-10-15 01:28:07,856 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2019-10-15 01:28:07,856 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2019-10-15 01:28:07,856 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-10-15 01:28:07,856 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-10-15 01:28:07,856 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-10-15 01:28:07,856 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L439 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1))) [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2019-10-15 01:28:07,857 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2019-10-15 01:28:07,858 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2019-10-15 01:28:07,859 INFO L443 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2019-10-15 01:28:07,859 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2019-10-15 01:28:07,859 INFO L439 ceAbstractionStarter]: At program point L130(lines 126 539) 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-10-15 01:28:07,859 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2019-10-15 01:28:07,859 INFO L443 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2019-10-15 01:28:07,859 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2019-10-15 01:28:07,859 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2019-10-15 01:28:07,859 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2019-10-15 01:28:07,859 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:28:07,860 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2019-10-15 01:28:07,860 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2019-10-15 01:28:07,861 INFO L439 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2019-10-15 01:28:07,861 INFO L443 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2019-10-15 01:28:07,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:28:07 BoogieIcfgContainer [2019-10-15 01:28:07,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:28:07,892 INFO L168 Benchmark]: Toolchain (without parser) took 29142.95 ms. Allocated memory was 138.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 102.3 MB in the beginning and 875.5 MB in the end (delta: -773.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-15 01:28:07,893 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:28:07,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.68 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 102.1 MB in the beginning and 179.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:07,894 INFO L168 Benchmark]: Boogie Preprocessor took 56.36 ms. Allocated memory is still 204.5 MB. Free memory was 179.6 MB in the beginning and 176.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:07,895 INFO L168 Benchmark]: RCFGBuilder took 797.95 ms. Allocated memory is still 204.5 MB. Free memory was 176.9 MB in the beginning and 129.6 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:07,897 INFO L168 Benchmark]: TraceAbstraction took 27807.73 ms. Allocated memory was 204.5 MB in the beginning and 1.2 GB in the end (delta: 994.6 MB). Free memory was 129.0 MB in the beginning and 875.5 MB in the end (delta: -746.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-10-15 01:28:07,904 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.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.68 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 102.1 MB in the beginning and 179.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.36 ms. Allocated memory is still 204.5 MB. Free memory was 179.6 MB in the beginning and 176.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.95 ms. Allocated memory is still 204.5 MB. Free memory was 176.9 MB in the beginning and 129.6 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27807.73 ms. Allocated memory was 204.5 MB in the beginning and 1.2 GB in the end (delta: 994.6 MB). Free memory was 129.0 MB in the beginning and 875.5 MB in the end (delta: -746.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: 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: 162]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4384 < s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4384 < s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (s__state < 4400 && blastFlag <= 0 && 4352 <= s__state) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((blastFlag <= 4 && s__hit == 0) && s__state <= 4560) && 4384 < s__state) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((blastFlag <= 2 && 4384 == s__state) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0)) || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || !(12292 <= \old(initial_state))) || ((4464 == s__state && blastFlag <= 4) && 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__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && s__state < 4400) && 4368 < s__state) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 27.7s, OverallIterations: 27, TraceHistogramMax: 21, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 5435 SDtfs, 2609 SDslu, 3839 SDs, 0 SdLazy, 3163 SolverSat, 615 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5195 GetRequests, 5141 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 5536 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 241 NumberOfFragments, 691 HoareAnnotationTreeSize, 26 FomulaSimplifications, 30253 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 26 FomulaSimplificationsInter, 3432 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 9147 NumberOfCodeBlocks, 8892 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 11659 ConstructedInterpolants, 0 QuantifiedInterpolants, 6471569 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4359 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 39 InterpolantComputations, 27 PerfectInterpolantSequences, 50371/50495 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...