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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:46:58,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:46:58,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:46:58,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:46:58,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:46:58,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:46:58,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:46:58,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:46:58,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:46:58,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:46:58,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:46:58,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:46:58,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:46:58,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:46:58,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:46:58,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:46:58,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:46:58,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:46:58,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:46:58,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:46:58,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:46:58,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:46:58,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:46:58,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:46:58,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:46:58,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:46:58,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:46:58,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:46:58,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:46:58,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:46:58,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:46:58,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:46:58,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:46:58,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:46:58,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:46:58,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:46:58,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:46:58,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:46:58,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:46:58,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:46:58,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:46:58,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:46:58,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:46:58,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:46:58,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:46:58,306 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:46:58,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:46:58,307 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:46:58,307 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:46:58,307 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:46:58,307 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:46:58,307 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:46:58,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:46:58,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:46:58,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:46:58,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:46:58,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:46:58,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:46:58,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:46:58,310 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:46:58,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:46:58,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:46:58,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:46:58,310 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:46:58,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:46:58,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:46:58,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:46:58,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:46:58,311 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:46:58,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:46:58,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:46:58,312 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:46:58,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:46:58,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:46:58,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:46:58,357 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:46:58,357 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:46:58,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-09-09 05:46:58,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392602109/e3e77af73f36423eaa3aec375e2d8574/FLAG2da2b0ebb [2019-09-09 05:46:58,978 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:46:58,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-09-09 05:46:58,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392602109/e3e77af73f36423eaa3aec375e2d8574/FLAG2da2b0ebb [2019-09-09 05:46:59,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392602109/e3e77af73f36423eaa3aec375e2d8574 [2019-09-09 05:46:59,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:46:59,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:46:59,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:59,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:46:59,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:46:59,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cabaad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59, skipping insertion in model container [2019-09-09 05:46:59,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,305 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:46:59,361 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:46:59,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:59,607 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:46:59,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:59,776 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:46:59,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59 WrapperNode [2019-09-09 05:46:59,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:59,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:46:59,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:46:59,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:46:59,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (1/1) ... [2019-09-09 05:46:59,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:46:59,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:46:59,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:46:59,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:46:59,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (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-09-09 05:46:59,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:46:59,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:46:59,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-09 05:46:59,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:46:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:46:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:46:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-09 05:46:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:46:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:46:59,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:47:00,016 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:47:00,517 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-09 05:47:00,517 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-09 05:47:00,532 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:47:00,532 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:47:00,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:47:00 BoogieIcfgContainer [2019-09-09 05:47:00,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:47:00,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:47:00,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:47:00,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:47:00,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:46:59" (1/3) ... [2019-09-09 05:47:00,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bbd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:47:00, skipping insertion in model container [2019-09-09 05:47:00,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:59" (2/3) ... [2019-09-09 05:47:00,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bbd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:47:00, skipping insertion in model container [2019-09-09 05:47:00,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:47:00" (3/3) ... [2019-09-09 05:47:00,547 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-09-09 05:47:00,558 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:47:00,579 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:47:00,598 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:47:00,635 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:47:00,635 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:47:00,635 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:47:00,635 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:47:00,636 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:47:00,636 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:47:00,636 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:47:00,636 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:47:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-09-09 05:47:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:47:00,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:00,669 INFO L399 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-09-09 05:47:00,671 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2007307722, now seen corresponding path program 1 times [2019-09-09 05:47:00,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:00,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:00,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:47:00,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:00,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:00,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:00,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:00,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:00,898 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2019-09-09 05:47:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:01,075 INFO L93 Difference]: Finished difference Result 245 states and 408 transitions. [2019-09-09 05:47:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:01,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:47:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:01,102 INFO L225 Difference]: With dead ends: 245 [2019-09-09 05:47:01,102 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:47:01,105 INFO L628 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-09-09 05:47:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:47:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-09-09 05:47:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-09 05:47:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-09-09 05:47:01,213 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 29 [2019-09-09 05:47:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:01,214 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-09-09 05:47:01,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-09-09 05:47:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-09 05:47:01,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:01,220 INFO L399 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-09-09 05:47:01,221 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1381474291, now seen corresponding path program 1 times [2019-09-09 05:47:01,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:01,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:01,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:47:01,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:01,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:01,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:01,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:01,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:01,338 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-09-09 05:47:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:01,565 INFO L93 Difference]: Finished difference Result 258 states and 378 transitions. [2019-09-09 05:47:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:01,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-09 05:47:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:01,568 INFO L225 Difference]: With dead ends: 258 [2019-09-09 05:47:01,568 INFO L226 Difference]: Without dead ends: 258 [2019-09-09 05:47:01,569 INFO L628 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-09-09 05:47:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-09 05:47:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2019-09-09 05:47:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-09 05:47:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2019-09-09 05:47:01,587 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 43 [2019-09-09 05:47:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:01,588 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2019-09-09 05:47:01,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2019-09-09 05:47:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:47:01,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:01,594 INFO L399 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-09-09 05:47:01,595 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash 632602009, now seen corresponding path program 1 times [2019-09-09 05:47:01,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:01,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:47:01,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:01,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:01,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:01,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:01,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:01,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:01,684 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand 3 states. [2019-09-09 05:47:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:01,917 INFO L93 Difference]: Finished difference Result 348 states and 486 transitions. [2019-09-09 05:47:01,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:01,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-09 05:47:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:01,921 INFO L225 Difference]: With dead ends: 348 [2019-09-09 05:47:01,922 INFO L226 Difference]: Without dead ends: 346 [2019-09-09 05:47:01,922 INFO L628 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-09-09 05:47:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-09 05:47:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2019-09-09 05:47:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-09 05:47:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 464 transitions. [2019-09-09 05:47:01,956 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 464 transitions. Word has length 60 [2019-09-09 05:47:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:01,956 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 464 transitions. [2019-09-09 05:47:01,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 464 transitions. [2019-09-09 05:47:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:47:01,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:01,965 INFO L399 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-09-09 05:47:01,965 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:01,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:01,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1172836325, now seen corresponding path program 1 times [2019-09-09 05:47:01,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:01,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:01,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:01,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:47:02,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:02,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:02,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:02,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:02,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:02,067 INFO L87 Difference]: Start difference. First operand 330 states and 464 transitions. Second operand 3 states. [2019-09-09 05:47:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:02,217 INFO L93 Difference]: Finished difference Result 376 states and 523 transitions. [2019-09-09 05:47:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:02,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-09 05:47:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:02,221 INFO L225 Difference]: With dead ends: 376 [2019-09-09 05:47:02,221 INFO L226 Difference]: Without dead ends: 376 [2019-09-09 05:47:02,222 INFO L628 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-09-09 05:47:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-09 05:47:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2019-09-09 05:47:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-09 05:47:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 512 transitions. [2019-09-09 05:47:02,233 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 512 transitions. Word has length 60 [2019-09-09 05:47:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:02,233 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 512 transitions. [2019-09-09 05:47:02,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 512 transitions. [2019-09-09 05:47:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-09 05:47:02,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:02,237 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:02,237 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash 244907033, now seen corresponding path program 1 times [2019-09-09 05:47:02,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:02,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-09 05:47:02,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:02,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:02,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:02,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:02,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:02,291 INFO L87 Difference]: Start difference. First operand 368 states and 512 transitions. Second operand 3 states. [2019-09-09 05:47:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:02,497 INFO L93 Difference]: Finished difference Result 472 states and 678 transitions. [2019-09-09 05:47:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:02,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-09 05:47:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:02,503 INFO L225 Difference]: With dead ends: 472 [2019-09-09 05:47:02,504 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:47:02,504 INFO L628 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-09-09 05:47:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:47:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 446. [2019-09-09 05:47:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-09 05:47:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2019-09-09 05:47:02,533 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 72 [2019-09-09 05:47:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:02,533 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2019-09-09 05:47:02,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2019-09-09 05:47:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:47:02,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:02,535 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:02,536 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:02,536 INFO L82 PathProgramCache]: Analyzing trace with hash -834546447, now seen corresponding path program 1 times [2019-09-09 05:47:02,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:02,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-09 05:47:02,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:02,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:02,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:02,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:02,580 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand 3 states. [2019-09-09 05:47:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:02,697 INFO L93 Difference]: Finished difference Result 494 states and 705 transitions. [2019-09-09 05:47:02,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:02,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-09 05:47:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:02,702 INFO L225 Difference]: With dead ends: 494 [2019-09-09 05:47:02,702 INFO L226 Difference]: Without dead ends: 494 [2019-09-09 05:47:02,702 INFO L628 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-09-09 05:47:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-09 05:47:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2019-09-09 05:47:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-09 05:47:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 698 transitions. [2019-09-09 05:47:02,718 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 698 transitions. Word has length 76 [2019-09-09 05:47:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:02,720 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 698 transitions. [2019-09-09 05:47:02,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 698 transitions. [2019-09-09 05:47:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 05:47:02,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:02,723 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:02,724 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:02,724 INFO L82 PathProgramCache]: Analyzing trace with hash -532111447, now seen corresponding path program 1 times [2019-09-09 05:47:02,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:47:02,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:02,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:02,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:02,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:02,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:02,826 INFO L87 Difference]: Start difference. First operand 488 states and 698 transitions. Second operand 3 states. [2019-09-09 05:47:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:02,869 INFO L93 Difference]: Finished difference Result 725 states and 1038 transitions. [2019-09-09 05:47:02,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:02,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-09 05:47:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:02,873 INFO L225 Difference]: With dead ends: 725 [2019-09-09 05:47:02,874 INFO L226 Difference]: Without dead ends: 725 [2019-09-09 05:47:02,874 INFO L628 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-09-09 05:47:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-09-09 05:47:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2019-09-09 05:47:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-09-09 05:47:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2019-09-09 05:47:02,891 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 96 [2019-09-09 05:47:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:02,892 INFO L475 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2019-09-09 05:47:02,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2019-09-09 05:47:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-09 05:47:02,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:02,894 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:02,894 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:02,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2130642131, now seen corresponding path program 1 times [2019-09-09 05:47:02,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:02,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-09 05:47:02,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:02,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:02,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:02,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:02,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:02,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:02,942 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2019-09-09 05:47:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:02,991 INFO L93 Difference]: Finished difference Result 962 states and 1380 transitions. [2019-09-09 05:47:02,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:02,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-09 05:47:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:02,998 INFO L225 Difference]: With dead ends: 962 [2019-09-09 05:47:02,998 INFO L226 Difference]: Without dead ends: 962 [2019-09-09 05:47:02,999 INFO L628 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-09-09 05:47:03,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-09-09 05:47:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-09-09 05:47:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-09-09 05:47:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2019-09-09 05:47:03,025 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 98 [2019-09-09 05:47:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:03,025 INFO L475 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2019-09-09 05:47:03,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2019-09-09 05:47:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:47:03,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:03,029 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:03,029 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:03,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1135672730, now seen corresponding path program 1 times [2019-09-09 05:47:03,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:03,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:03,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:03,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:03,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-09 05:47:03,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:03,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:03,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:03,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:03,107 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand 3 states. [2019-09-09 05:47:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:03,292 INFO L93 Difference]: Finished difference Result 1162 states and 1672 transitions. [2019-09-09 05:47:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:03,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-09 05:47:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:03,298 INFO L225 Difference]: With dead ends: 1162 [2019-09-09 05:47:03,299 INFO L226 Difference]: Without dead ends: 1154 [2019-09-09 05:47:03,299 INFO L628 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-09-09 05:47:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-09-09 05:47:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2019-09-09 05:47:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-09-09 05:47:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1620 transitions. [2019-09-09 05:47:03,325 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1620 transitions. Word has length 152 [2019-09-09 05:47:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:03,326 INFO L475 AbstractCegarLoop]: Abstraction has 1118 states and 1620 transitions. [2019-09-09 05:47:03,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1620 transitions. [2019-09-09 05:47:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-09 05:47:03,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:03,330 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:03,331 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:03,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash -862106901, now seen corresponding path program 1 times [2019-09-09 05:47:03,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:03,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:03,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-09 05:47:03,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:03,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:03,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:03,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:03,396 INFO L87 Difference]: Start difference. First operand 1118 states and 1620 transitions. Second operand 3 states. [2019-09-09 05:47:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:03,527 INFO L93 Difference]: Finished difference Result 1224 states and 1746 transitions. [2019-09-09 05:47:03,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:03,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-09 05:47:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:03,539 INFO L225 Difference]: With dead ends: 1224 [2019-09-09 05:47:03,540 INFO L226 Difference]: Without dead ends: 1224 [2019-09-09 05:47:03,540 INFO L628 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-09-09 05:47:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-09 05:47:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1210. [2019-09-09 05:47:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-09-09 05:47:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1732 transitions. [2019-09-09 05:47:03,577 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1732 transitions. Word has length 188 [2019-09-09 05:47:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:03,578 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1732 transitions. [2019-09-09 05:47:03,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1732 transitions. [2019-09-09 05:47:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-09 05:47:03,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:03,584 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:03,584 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:03,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2139251602, now seen corresponding path program 1 times [2019-09-09 05:47:03,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:03,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:03,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:03,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-09 05:47:03,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:03,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:03,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:03,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:03,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:03,692 INFO L87 Difference]: Start difference. First operand 1210 states and 1732 transitions. Second operand 3 states. [2019-09-09 05:47:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:03,841 INFO L93 Difference]: Finished difference Result 1322 states and 1868 transitions. [2019-09-09 05:47:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:03,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-09 05:47:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:03,849 INFO L225 Difference]: With dead ends: 1322 [2019-09-09 05:47:03,849 INFO L226 Difference]: Without dead ends: 1322 [2019-09-09 05:47:03,849 INFO L628 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-09-09 05:47:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-09 05:47:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1310. [2019-09-09 05:47:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-09-09 05:47:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1852 transitions. [2019-09-09 05:47:03,880 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1852 transitions. Word has length 209 [2019-09-09 05:47:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:03,880 INFO L475 AbstractCegarLoop]: Abstraction has 1310 states and 1852 transitions. [2019-09-09 05:47:03,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1852 transitions. [2019-09-09 05:47:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-09 05:47:03,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:03,887 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:03,887 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1924345883, now seen corresponding path program 1 times [2019-09-09 05:47:03,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:03,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:03,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:03,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:03,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-09 05:47:04,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:04,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:04,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:04,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:04,019 INFO L87 Difference]: Start difference. First operand 1310 states and 1852 transitions. Second operand 3 states. [2019-09-09 05:47:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:04,216 INFO L93 Difference]: Finished difference Result 1430 states and 1992 transitions. [2019-09-09 05:47:04,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:04,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-09 05:47:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:04,229 INFO L225 Difference]: With dead ends: 1430 [2019-09-09 05:47:04,229 INFO L226 Difference]: Without dead ends: 1430 [2019-09-09 05:47:04,230 INFO L628 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-09-09 05:47:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-09-09 05:47:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1422. [2019-09-09 05:47:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-09-09 05:47:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1984 transitions. [2019-09-09 05:47:04,280 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1984 transitions. Word has length 233 [2019-09-09 05:47:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:04,281 INFO L475 AbstractCegarLoop]: Abstraction has 1422 states and 1984 transitions. [2019-09-09 05:47:04,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1984 transitions. [2019-09-09 05:47:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-09 05:47:04,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:04,291 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:04,291 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:04,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:04,292 INFO L82 PathProgramCache]: Analyzing trace with hash -643476451, now seen corresponding path program 1 times [2019-09-09 05:47:04,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:04,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:04,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-09 05:47:04,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:04,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:04,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:04,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:04,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:04,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:04,433 INFO L87 Difference]: Start difference. First operand 1422 states and 1984 transitions. Second operand 3 states. [2019-09-09 05:47:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:04,572 INFO L93 Difference]: Finished difference Result 1558 states and 2144 transitions. [2019-09-09 05:47:04,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:04,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-09 05:47:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:04,580 INFO L225 Difference]: With dead ends: 1558 [2019-09-09 05:47:04,581 INFO L226 Difference]: Without dead ends: 1558 [2019-09-09 05:47:04,581 INFO L628 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-09-09 05:47:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-09-09 05:47:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2019-09-09 05:47:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-09-09 05:47:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2128 transitions. [2019-09-09 05:47:04,617 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2128 transitions. Word has length 233 [2019-09-09 05:47:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:04,618 INFO L475 AbstractCegarLoop]: Abstraction has 1546 states and 2128 transitions. [2019-09-09 05:47:04,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2128 transitions. [2019-09-09 05:47:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-09 05:47:04,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:04,624 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:04,624 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:04,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:04,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1388986723, now seen corresponding path program 1 times [2019-09-09 05:47:04,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:04,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:04,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:04,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:04,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-09 05:47:04,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:04,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:04,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:04,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:04,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:04,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:04,742 INFO L87 Difference]: Start difference. First operand 1546 states and 2128 transitions. Second operand 3 states. [2019-09-09 05:47:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:04,924 INFO L93 Difference]: Finished difference Result 1698 states and 2300 transitions. [2019-09-09 05:47:04,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:04,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-09 05:47:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:04,934 INFO L225 Difference]: With dead ends: 1698 [2019-09-09 05:47:04,934 INFO L226 Difference]: Without dead ends: 1698 [2019-09-09 05:47:04,934 INFO L628 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-09-09 05:47:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-09 05:47:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1690. [2019-09-09 05:47:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-09-09 05:47:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2292 transitions. [2019-09-09 05:47:04,970 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2292 transitions. Word has length 263 [2019-09-09 05:47:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:04,970 INFO L475 AbstractCegarLoop]: Abstraction has 1690 states and 2292 transitions. [2019-09-09 05:47:04,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2292 transitions. [2019-09-09 05:47:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-09 05:47:04,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:04,977 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:04,977 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:04,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:04,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1178835611, now seen corresponding path program 1 times [2019-09-09 05:47:04,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:04,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:04,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:04,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:04,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-09 05:47:05,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:05,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:05,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:05,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:05,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:05,062 INFO L87 Difference]: Start difference. First operand 1690 states and 2292 transitions. Second operand 3 states. [2019-09-09 05:47:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:05,088 INFO L93 Difference]: Finished difference Result 3360 states and 4556 transitions. [2019-09-09 05:47:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:05,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-09 05:47:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:05,105 INFO L225 Difference]: With dead ends: 3360 [2019-09-09 05:47:05,105 INFO L226 Difference]: Without dead ends: 3360 [2019-09-09 05:47:05,106 INFO L628 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-09-09 05:47:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-09-09 05:47:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2019-09-09 05:47:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3358 states. [2019-09-09 05:47:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4555 transitions. [2019-09-09 05:47:05,183 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4555 transitions. Word has length 263 [2019-09-09 05:47:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:05,184 INFO L475 AbstractCegarLoop]: Abstraction has 3358 states and 4555 transitions. [2019-09-09 05:47:05,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4555 transitions. [2019-09-09 05:47:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-09 05:47:05,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:05,195 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:05,196 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:05,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash 554282629, now seen corresponding path program 1 times [2019-09-09 05:47:05,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:05,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:05,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:05,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:05,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-09-09 05:47:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:05,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:05,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:05,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:05,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:05,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:05,384 INFO L87 Difference]: Start difference. First operand 3358 states and 4555 transitions. Second operand 3 states. [2019-09-09 05:47:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:05,528 INFO L93 Difference]: Finished difference Result 3506 states and 4723 transitions. [2019-09-09 05:47:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:05,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-09-09 05:47:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:05,547 INFO L225 Difference]: With dead ends: 3506 [2019-09-09 05:47:05,547 INFO L226 Difference]: Without dead ends: 3506 [2019-09-09 05:47:05,547 INFO L628 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-09-09 05:47:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-09-09 05:47:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-09-09 05:47:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-09-09 05:47:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4707 transitions. [2019-09-09 05:47:05,623 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4707 transitions. Word has length 287 [2019-09-09 05:47:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:05,623 INFO L475 AbstractCegarLoop]: Abstraction has 3490 states and 4707 transitions. [2019-09-09 05:47:05,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4707 transitions. [2019-09-09 05:47:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-09 05:47:05,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:05,633 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:05,634 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1163110431, now seen corresponding path program 1 times [2019-09-09 05:47:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:05,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:05,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:05,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-09 05:47:05,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:05,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:05,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:05,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:05,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:05,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:05,719 INFO L87 Difference]: Start difference. First operand 3490 states and 4707 transitions. Second operand 3 states. [2019-09-09 05:47:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:05,873 INFO L93 Difference]: Finished difference Result 3882 states and 5171 transitions. [2019-09-09 05:47:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:05,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-09 05:47:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:05,892 INFO L225 Difference]: With dead ends: 3882 [2019-09-09 05:47:05,892 INFO L226 Difference]: Without dead ends: 3882 [2019-09-09 05:47:05,893 INFO L628 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-09-09 05:47:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-09-09 05:47:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3802. [2019-09-09 05:47:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2019-09-09 05:47:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5075 transitions. [2019-09-09 05:47:05,984 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5075 transitions. Word has length 298 [2019-09-09 05:47:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:05,985 INFO L475 AbstractCegarLoop]: Abstraction has 3802 states and 5075 transitions. [2019-09-09 05:47:05,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5075 transitions. [2019-09-09 05:47:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-09 05:47:06,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:06,001 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:06,001 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash -121210371, now seen corresponding path program 1 times [2019-09-09 05:47:06,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:06,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:06,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:06,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:06,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-09-09 05:47:06,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:06,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:06,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:06,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:06,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:06,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:06,095 INFO L87 Difference]: Start difference. First operand 3802 states and 5075 transitions. Second operand 3 states. [2019-09-09 05:47:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:06,305 INFO L93 Difference]: Finished difference Result 4202 states and 5515 transitions. [2019-09-09 05:47:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:06,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-09 05:47:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:06,351 INFO L225 Difference]: With dead ends: 4202 [2019-09-09 05:47:06,352 INFO L226 Difference]: Without dead ends: 4202 [2019-09-09 05:47:06,356 INFO L628 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-09-09 05:47:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-09-09 05:47:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3922. [2019-09-09 05:47:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-09-09 05:47:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5219 transitions. [2019-09-09 05:47:06,450 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5219 transitions. Word has length 311 [2019-09-09 05:47:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:06,451 INFO L475 AbstractCegarLoop]: Abstraction has 3922 states and 5219 transitions. [2019-09-09 05:47:06,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5219 transitions. [2019-09-09 05:47:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-09 05:47:06,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:06,468 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:06,469 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:06,470 INFO L82 PathProgramCache]: Analyzing trace with hash -828607418, now seen corresponding path program 1 times [2019-09-09 05:47:06,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:06,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:06,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:06,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:06,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-09-09 05:47:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:06,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:06,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:06,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:06,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:06,728 INFO L87 Difference]: Start difference. First operand 3922 states and 5219 transitions. Second operand 3 states. [2019-09-09 05:47:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:06,761 INFO L93 Difference]: Finished difference Result 7328 states and 9806 transitions. [2019-09-09 05:47:06,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:06,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-09 05:47:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:06,778 INFO L225 Difference]: With dead ends: 7328 [2019-09-09 05:47:06,778 INFO L226 Difference]: Without dead ends: 7328 [2019-09-09 05:47:06,779 INFO L628 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-09-09 05:47:06,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-09-09 05:47:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7326. [2019-09-09 05:47:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-09-09 05:47:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9805 transitions. [2019-09-09 05:47:06,887 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9805 transitions. Word has length 312 [2019-09-09 05:47:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:06,888 INFO L475 AbstractCegarLoop]: Abstraction has 7326 states and 9805 transitions. [2019-09-09 05:47:06,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9805 transitions. [2019-09-09 05:47:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-09 05:47:06,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:06,902 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:06,903 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash -935849662, now seen corresponding path program 1 times [2019-09-09 05:47:06,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:06,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:06,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:06,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:06,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-09 05:47:06,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:06,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:06,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:06,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:06,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:06,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:06,998 INFO L87 Difference]: Start difference. First operand 7326 states and 9805 transitions. Second operand 3 states. [2019-09-09 05:47:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:07,155 INFO L93 Difference]: Finished difference Result 7334 states and 9557 transitions. [2019-09-09 05:47:07,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:07,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-09 05:47:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:07,172 INFO L225 Difference]: With dead ends: 7334 [2019-09-09 05:47:07,173 INFO L226 Difference]: Without dead ends: 7334 [2019-09-09 05:47:07,173 INFO L628 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-09-09 05:47:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-09-09 05:47:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 7302. [2019-09-09 05:47:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-09-09 05:47:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9525 transitions. [2019-09-09 05:47:07,282 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9525 transitions. Word has length 313 [2019-09-09 05:47:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:07,283 INFO L475 AbstractCegarLoop]: Abstraction has 7302 states and 9525 transitions. [2019-09-09 05:47:07,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9525 transitions. [2019-09-09 05:47:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-09 05:47:07,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:07,299 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:07,299 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:07,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1555626477, now seen corresponding path program 1 times [2019-09-09 05:47:07,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:07,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:07,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:07,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:07,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 765 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-09 05:47:07,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:07,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:07,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 337 with the following transitions: [2019-09-09 05:47:07,470 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [244], [247], [255], [258], [263], [266], [268], [271], [279], [284], [286], [290], [292], [295], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-09-09 05:47:07,511 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:07,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:07,601 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:47:07,603 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 37 root evaluator evaluations with a maximum evaluation depth of 5. Performed 37 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 69 variables. [2019-09-09 05:47:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:07,607 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:47:07,791 INFO L227 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 86.9% of their original sizes. [2019-09-09 05:47:07,791 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:47:07,843 INFO L420 sIntCurrentIteration]: We unified 335 AI predicates to 335 [2019-09-09 05:47:07,843 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:47:07,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:47:07,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2019-09-09 05:47:07,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:07,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:47:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:47:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:47:07,846 INFO L87 Difference]: Start difference. First operand 7302 states and 9525 transitions. Second operand 8 states. [2019-09-09 05:47:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:08,380 INFO L93 Difference]: Finished difference Result 7306 states and 9529 transitions. [2019-09-09 05:47:08,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:47:08,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 336 [2019-09-09 05:47:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:08,395 INFO L225 Difference]: With dead ends: 7306 [2019-09-09 05:47:08,395 INFO L226 Difference]: Without dead ends: 7306 [2019-09-09 05:47:08,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:47:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-09 05:47:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7305. [2019-09-09 05:47:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2019-09-09 05:47:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9528 transitions. [2019-09-09 05:47:08,515 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9528 transitions. Word has length 336 [2019-09-09 05:47:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:08,515 INFO L475 AbstractCegarLoop]: Abstraction has 7305 states and 9528 transitions. [2019-09-09 05:47:08,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:47:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9528 transitions. [2019-09-09 05:47:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-09 05:47:08,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:08,536 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:47:08,536 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:08,537 INFO L82 PathProgramCache]: Analyzing trace with hash 923098349, now seen corresponding path program 1 times [2019-09-09 05:47:08,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:08,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:08,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:08,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:08,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-09-09 05:47:08,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:08,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:08,826 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2019-09-09 05:47:08,827 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [216], [231], [237], [242], [244], [247], [255], [258], [263], [266], [268], [271], [279], [284], [286], [290], [292], [295], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-09-09 05:47:08,831 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:08,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:08,843 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:10,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:47:10,755 INFO L272 AbstractInterpreter]: Visited 108 different actions 2263 times. Merged at 98 different actions 1816 times. Widened at 22 different actions 233 times. Performed 5747 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5747 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 324 fixpoints after 32 different actions. Largest state had 69 variables. [2019-09-09 05:47:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:10,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:47:10,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:10,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:47:10,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:10,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:47:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:10,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:47:10,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:47:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-09-09 05:47:11,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:47:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-09-09 05:47:11,374 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:47:11,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:47:11,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:11,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:11,376 INFO L87 Difference]: Start difference. First operand 7305 states and 9528 transitions. Second operand 3 states. [2019-09-09 05:47:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:11,448 INFO L93 Difference]: Finished difference Result 10933 states and 14232 transitions. [2019-09-09 05:47:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:11,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-09-09 05:47:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:11,472 INFO L225 Difference]: With dead ends: 10933 [2019-09-09 05:47:11,472 INFO L226 Difference]: Without dead ends: 10933 [2019-09-09 05:47:11,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 695 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2019-09-09 05:47:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 10933. [2019-09-09 05:47:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10933 states. [2019-09-09 05:47:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 14232 transitions. [2019-09-09 05:47:11,775 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 14232 transitions. Word has length 348 [2019-09-09 05:47:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:11,776 INFO L475 AbstractCegarLoop]: Abstraction has 10933 states and 14232 transitions. [2019-09-09 05:47:11,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 14232 transitions. [2019-09-09 05:47:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-09 05:47:11,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:11,800 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:11,801 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1817523371, now seen corresponding path program 1 times [2019-09-09 05:47:11,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:11,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:11,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:11,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-09-09 05:47:12,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:12,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:12,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 351 with the following transitions: [2019-09-09 05:47:12,059 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [216], [231], [237], [242], [244], [247], [255], [258], [263], [266], [268], [271], [279], [284], [286], [292], [295], [297], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-09-09 05:47:12,073 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:12,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:12,083 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:13,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:47:13,301 INFO L272 AbstractInterpreter]: Visited 108 different actions 2264 times. Merged at 98 different actions 1824 times. Widened at 22 different actions 227 times. Performed 5663 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5663 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 317 fixpoints after 34 different actions. Largest state had 69 variables. [2019-09-09 05:47:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:13,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:47:13,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:13,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:47:13,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:13,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:47:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:13,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:47:13,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:47:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-09-09 05:47:13,577 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:47:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:47:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:47:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:47:13,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:47:13,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:47:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:47:13,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:13,674 INFO L87 Difference]: Start difference. First operand 10933 states and 14232 transitions. Second operand 4 states. [2019-09-09 05:47:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:14,070 INFO L93 Difference]: Finished difference Result 16381 states and 20991 transitions. [2019-09-09 05:47:14,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:47:14,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2019-09-09 05:47:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:14,103 INFO L225 Difference]: With dead ends: 16381 [2019-09-09 05:47:14,103 INFO L226 Difference]: Without dead ends: 16369 [2019-09-09 05:47:14,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 700 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-09-09 05:47:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16369 states. [2019-09-09 05:47:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16369 to 12565. [2019-09-09 05:47:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12565 states. [2019-09-09 05:47:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12565 states to 12565 states and 16452 transitions. [2019-09-09 05:47:14,305 INFO L78 Accepts]: Start accepts. Automaton has 12565 states and 16452 transitions. Word has length 350 [2019-09-09 05:47:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:14,306 INFO L475 AbstractCegarLoop]: Abstraction has 12565 states and 16452 transitions. [2019-09-09 05:47:14,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:47:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 12565 states and 16452 transitions. [2019-09-09 05:47:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-09 05:47:14,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:14,327 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:14,327 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:14,328 INFO L82 PathProgramCache]: Analyzing trace with hash -299155883, now seen corresponding path program 2 times [2019-09-09 05:47:14,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:14,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:14,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:14,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:14,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-09-09 05:47:14,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:14,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:14,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:47:14,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:47:14,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:14,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:47:14,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:47:14,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:47:14,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-09 05:47:14,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:47:14,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:47:14,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:47:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-09 05:47:14,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:47:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-09 05:47:14,872 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:47:14,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:47:14,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:14,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:14,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:14,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:14,874 INFO L87 Difference]: Start difference. First operand 12565 states and 16452 transitions. Second operand 3 states. [2019-09-09 05:47:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:15,005 INFO L93 Difference]: Finished difference Result 11773 states and 14784 transitions. [2019-09-09 05:47:15,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:15,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-09-09 05:47:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:15,031 INFO L225 Difference]: With dead ends: 11773 [2019-09-09 05:47:15,032 INFO L226 Difference]: Without dead ends: 11773 [2019-09-09 05:47:15,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11773 states. [2019-09-09 05:47:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11773 to 11413. [2019-09-09 05:47:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11413 states. [2019-09-09 05:47:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11413 states to 11413 states and 14316 transitions. [2019-09-09 05:47:15,182 INFO L78 Accepts]: Start accepts. Automaton has 11413 states and 14316 transitions. Word has length 362 [2019-09-09 05:47:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:15,183 INFO L475 AbstractCegarLoop]: Abstraction has 11413 states and 14316 transitions. [2019-09-09 05:47:15,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11413 states and 14316 transitions. [2019-09-09 05:47:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-09 05:47:15,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:15,207 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:15,207 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2019228612, now seen corresponding path program 1 times [2019-09-09 05:47:15,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:15,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:15,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:47:15,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:15,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-09 05:47:15,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:15,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:15,360 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 377 with the following transitions: [2019-09-09 05:47:15,362 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [216], [231], [237], [242], [244], [247], [249], [255], [258], [263], [266], [268], [271], [279], [284], [286], [292], [295], [297], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-09-09 05:47:15,368 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:15,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:15,382 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:16,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:47:16,670 INFO L272 AbstractInterpreter]: Visited 109 different actions 2348 times. Merged at 99 different actions 1872 times. Widened at 21 different actions 224 times. Performed 5894 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5894 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 351 fixpoints after 34 different actions. Largest state had 69 variables. [2019-09-09 05:47:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:16,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:47:16,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:16,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:47:16,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:16,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:47:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:16,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:47:16,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:47:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-09 05:47:16,857 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:47:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-09 05:47:16,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:47:16,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:47:16,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:47:16,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:47:16,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:47:16,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:16,957 INFO L87 Difference]: Start difference. First operand 11413 states and 14316 transitions. Second operand 4 states. [2019-09-09 05:47:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:17,298 INFO L93 Difference]: Finished difference Result 13943 states and 17191 transitions. [2019-09-09 05:47:17,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:47:17,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-09-09 05:47:17,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:17,319 INFO L225 Difference]: With dead ends: 13943 [2019-09-09 05:47:17,319 INFO L226 Difference]: Without dead ends: 13931 [2019-09-09 05:47:17,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:47:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2019-09-09 05:47:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 11691. [2019-09-09 05:47:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11691 states. [2019-09-09 05:47:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11691 states to 11691 states and 14573 transitions. [2019-09-09 05:47:17,478 INFO L78 Accepts]: Start accepts. Automaton has 11691 states and 14573 transitions. Word has length 376 [2019-09-09 05:47:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:17,479 INFO L475 AbstractCegarLoop]: Abstraction has 11691 states and 14573 transitions. [2019-09-09 05:47:17,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:47:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 11691 states and 14573 transitions. [2019-09-09 05:47:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-09-09 05:47:17,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:17,493 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:17,493 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1965718292, now seen corresponding path program 1 times [2019-09-09 05:47:17,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:17,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:17,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-09-09 05:47:17,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:17,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:17,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:17,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:17,813 INFO L87 Difference]: Start difference. First operand 11691 states and 14573 transitions. Second operand 3 states. [2019-09-09 05:47:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:18,050 INFO L93 Difference]: Finished difference Result 11105 states and 13223 transitions. [2019-09-09 05:47:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:18,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2019-09-09 05:47:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:18,061 INFO L225 Difference]: With dead ends: 11105 [2019-09-09 05:47:18,062 INFO L226 Difference]: Without dead ends: 5423 [2019-09-09 05:47:18,062 INFO L628 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-09-09 05:47:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2019-09-09 05:47:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 5190. [2019-09-09 05:47:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5190 states. [2019-09-09 05:47:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6402 transitions. [2019-09-09 05:47:18,152 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6402 transitions. Word has length 415 [2019-09-09 05:47:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:18,152 INFO L475 AbstractCegarLoop]: Abstraction has 5190 states and 6402 transitions. [2019-09-09 05:47:18,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6402 transitions. [2019-09-09 05:47:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-09 05:47:18,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:18,165 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:18,165 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1027355828, now seen corresponding path program 1 times [2019-09-09 05:47:18,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:18,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:18,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-09-09 05:47:18,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:18,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:18,473 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 500 with the following transitions: [2019-09-09 05:47:18,476 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [216], [231], [237], [242], [244], [247], [255], [258], [263], [266], [268], [271], [279], [282], [284], [286], [292], [295], [297], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [410], [415], [420], [422], [427], [430], [434], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-09-09 05:47:18,479 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:18,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:18,495 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:20,152 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:47:20,153 INFO L272 AbstractInterpreter]: Visited 115 different actions 2371 times. Merged at 103 different actions 1898 times. Widened at 22 different actions 239 times. Performed 5925 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5925 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 343 fixpoints after 37 different actions. Largest state had 70 variables. [2019-09-09 05:47:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:20,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:47:20,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:20,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:47:20,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:20,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:47:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:20,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:47:20,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:47:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-09-09 05:47:20,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:47:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-09-09 05:47:20,868 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:47:20,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:47:20,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:20,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:20,870 INFO L87 Difference]: Start difference. First operand 5190 states and 6402 transitions. Second operand 3 states. [2019-09-09 05:47:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:20,885 INFO L93 Difference]: Finished difference Result 5189 states and 6405 transitions. [2019-09-09 05:47:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:20,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-09 05:47:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:20,894 INFO L225 Difference]: With dead ends: 5189 [2019-09-09 05:47:20,894 INFO L226 Difference]: Without dead ends: 5189 [2019-09-09 05:47:20,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 998 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:47:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2019-09-09 05:47:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5116. [2019-09-09 05:47:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5116 states. [2019-09-09 05:47:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5116 states to 5116 states and 6311 transitions. [2019-09-09 05:47:20,947 INFO L78 Accepts]: Start accepts. Automaton has 5116 states and 6311 transitions. Word has length 499 [2019-09-09 05:47:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:20,948 INFO L475 AbstractCegarLoop]: Abstraction has 5116 states and 6311 transitions. [2019-09-09 05:47:20,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5116 states and 6311 transitions. [2019-09-09 05:47:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-09-09 05:47:20,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:20,959 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:20,960 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -241116614, now seen corresponding path program 1 times [2019-09-09 05:47:20,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:20,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:20,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:20,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-09-09 05:47:21,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:21,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:21,320 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 610 with the following transitions: [2019-09-09 05:47:21,320 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [216], [231], [237], [242], [244], [247], [255], [258], [263], [266], [268], [271], [279], [282], [286], [292], [295], [303], [305], [307], [310], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [410], [415], [420], [422], [427], [430], [434], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-09-09 05:47:21,323 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:21,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:21,335 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:22,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:47:22,537 INFO L272 AbstractInterpreter]: Visited 112 different actions 2199 times. Merged at 98 different actions 1789 times. Widened at 20 different actions 235 times. Performed 5544 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5544 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 283 fixpoints after 34 different actions. Largest state had 70 variables. [2019-09-09 05:47:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:22,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:47:22,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:22,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:47:22,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:22,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:47:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:22,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:47:22,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:47:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-09-09 05:47:22,885 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:47:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-09-09 05:47:23,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:47:23,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:47:23,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:47:23,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:47:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:47:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:23,096 INFO L87 Difference]: Start difference. First operand 5116 states and 6311 transitions. Second operand 4 states. [2019-09-09 05:47:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:23,273 INFO L93 Difference]: Finished difference Result 511 states and 588 transitions. [2019-09-09 05:47:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:47:23,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 609 [2019-09-09 05:47:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:23,275 INFO L225 Difference]: With dead ends: 511 [2019-09-09 05:47:23,275 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:47:23,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1223 GetRequests, 1218 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-09-09 05:47:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:47:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:47:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:47:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:47:23,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2019-09-09 05:47:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:23,277 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:47:23,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:47:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:47:23,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:47:23,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:47:23 BoogieIcfgContainer [2019-09-09 05:47:23,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:47:23,291 INFO L168 Benchmark]: Toolchain (without parser) took 24003.22 ms. Allocated memory was 134.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 89.1 MB in the beginning and 724.2 MB in the end (delta: -635.1 MB). Peak memory consumption was 610.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:23,291 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:47:23,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.54 ms. Allocated memory was 134.2 MB in the beginning and 201.9 MB in the end (delta: 67.6 MB). Free memory was 89.1 MB in the beginning and 175.9 MB in the end (delta: -86.8 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:23,301 INFO L168 Benchmark]: Boogie Preprocessor took 50.04 ms. Allocated memory is still 201.9 MB. Free memory was 175.9 MB in the beginning and 173.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:23,302 INFO L168 Benchmark]: RCFGBuilder took 706.37 ms. Allocated memory is still 201.9 MB. Free memory was 173.2 MB in the beginning and 133.1 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:23,303 INFO L168 Benchmark]: TraceAbstraction took 22751.16 ms. Allocated memory was 201.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 132.3 MB in the beginning and 724.2 MB in the end (delta: -592.0 MB). Peak memory consumption was 586.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:47:23,313 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.22 ms. Allocated memory is still 134.2 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 490.54 ms. Allocated memory was 134.2 MB in the beginning and 201.9 MB in the end (delta: 67.6 MB). Free memory was 89.1 MB in the beginning and 175.9 MB in the end (delta: -86.8 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.04 ms. Allocated memory is still 201.9 MB. Free memory was 175.9 MB in the beginning and 173.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 706.37 ms. Allocated memory is still 201.9 MB. Free memory was 173.2 MB in the beginning and 133.1 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22751.16 ms. Allocated memory was 201.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 132.3 MB in the beginning and 724.2 MB in the end (delta: -592.0 MB). Peak memory consumption was 586.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 132 locations, 1 error locations. SAFE Result, 22.6s OverallTime, 28 OverallIterations, 21 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5663 SDtfs, 1902 SDslu, 3297 SDs, 0 SdLazy, 2598 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5512 GetRequests, 5458 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12565occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.5s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.8389925373134328 AbsIntWeakeningRatio, 0.3761194029850746 AbsIntAvgWeakeningVarsNumRemoved, -0.1044776119402985 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 7277 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 9435 NumberOfCodeBlocks, 9182 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 11939 ConstructedInterpolants, 0 QuantifiedInterpolants, 7523619 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3733 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 40 InterpolantComputations, 27 PerfectInterpolantSequences, 51889/52025 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...