java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:01,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:01,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:01,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:01,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:01,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:01,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:01,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:01,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:01,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:01,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:01,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:01,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:01,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:01,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:01,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:01,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:01,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:01,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:01,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:01,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:01,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:01,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:01,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:01,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:01,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:01,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:01,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:01,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:01,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:01,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:01,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:01,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:01,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:01,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:01,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:01,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:01,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:01,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:01,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:01,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:01,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:28:01,379 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:01,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:01,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:01,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:01,388 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:01,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:01,388 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:01,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:01,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:01,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:01,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:01,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:01,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:01,393 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:01,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:01,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:01,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:01,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:01,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:01,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:01,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:01,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:01,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:01,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:01,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:01,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:01,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:01,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:01,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:01,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:01,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:01,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:01,686 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:01,687 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:01,688 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-10-15 01:28:01,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8011d4b/8d726ff35c2d4c13a8f9f7977b4870ea/FLAGdd4f52ca8 [2019-10-15 01:28:02,227 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:02,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-10-15 01:28:02,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8011d4b/8d726ff35c2d4c13a8f9f7977b4870ea/FLAGdd4f52ca8 [2019-10-15 01:28:02,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8011d4b/8d726ff35c2d4c13a8f9f7977b4870ea [2019-10-15 01:28:02,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:02,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:02,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:02,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:02,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:02,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:02" (1/1) ... [2019-10-15 01:28:02,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341b5eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:02, skipping insertion in model container [2019-10-15 01:28:02,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:02" (1/1) ... [2019-10-15 01:28:02,609 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:02,672 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:02,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:02,990 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:03,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:03,170 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:03,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03 WrapperNode [2019-10-15 01:28:03,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:03,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:03,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:03,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:03,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (1/1) ... [2019-10-15 01:28:03,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (1/1) ... [2019-10-15 01:28:03,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (1/1) ... [2019-10-15 01:28:03,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (1/1) ... [2019-10-15 01:28:03,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (1/1) ... [2019-10-15 01:28:03,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (1/1) ... [2019-10-15 01:28:03,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (1/1) ... [2019-10-15 01:28:03,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:03,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:03,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:03,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:03,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:03,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:03,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:03,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 01:28:03,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:28:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:28:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:28:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 01:28:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:03,538 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:28:04,032 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 01:28:04,032 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 01:28:04,035 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:04,035 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:28:04,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:04 BoogieIcfgContainer [2019-10-15 01:28:04,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:04,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:04,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:04,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:04,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:02" (1/3) ... [2019-10-15 01:28:04,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d090084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:04, skipping insertion in model container [2019-10-15 01:28:04,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:03" (2/3) ... [2019-10-15 01:28:04,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d090084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:04, skipping insertion in model container [2019-10-15 01:28:04,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:04" (3/3) ... [2019-10-15 01:28:04,047 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-10-15 01:28:04,058 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:04,067 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:04,081 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:04,117 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:04,117 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:04,117 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:04,118 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:04,118 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:04,118 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:04,118 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:04,118 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-15 01:28:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:28:04,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,166 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:04,168 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-15 01:28:04,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700260832] [2019-10-15 01:28:04,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:04,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700260832] [2019-10-15 01:28:04,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:04,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:04,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417657520] [2019-10-15 01:28:04,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:04,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:04,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:04,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:04,505 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-15 01:28:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,002 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-15 01:28:05,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-15 01:28:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,027 INFO L225 Difference]: With dead ends: 337 [2019-10-15 01:28:05,027 INFO L226 Difference]: Without dead ends: 180 [2019-10-15 01:28:05,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-15 01:28:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-15 01:28:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-15 01:28:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-15 01:28:05,142 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-15 01:28:05,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,143 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-15 01:28:05,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-15 01:28:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:28:05,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,146 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:05,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-15 01:28:05,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907783814] [2019-10-15 01:28:05,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:05,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907783814] [2019-10-15 01:28:05,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214714558] [2019-10-15 01:28:05,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,257 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-15 01:28:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:05,595 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-15 01:28:05,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:05,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-15 01:28:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:05,600 INFO L225 Difference]: With dead ends: 385 [2019-10-15 01:28:05,600 INFO L226 Difference]: Without dead ends: 221 [2019-10-15 01:28:05,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-15 01:28:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-15 01:28:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-15 01:28:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-15 01:28:05,627 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-15 01:28:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:05,628 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-15 01:28:05,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-15 01:28:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:05,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:05,632 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:28:05,633 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1550770299, now seen corresponding path program 1 times [2019-10-15 01:28:05,634 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:05,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633335174] [2019-10-15 01:28:05,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:05,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:05,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633335174] [2019-10-15 01:28:05,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:05,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:05,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731367892] [2019-10-15 01:28:05,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:05,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:05,777 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-15 01:28:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,044 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-15 01:28:06,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,048 INFO L225 Difference]: With dead ends: 450 [2019-10-15 01:28:06,048 INFO L226 Difference]: Without dead ends: 247 [2019-10-15 01:28:06,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-15 01:28:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-15 01:28:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-15 01:28:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-15 01:28:06,082 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-15 01:28:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,084 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-15 01:28:06,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-15 01:28:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:28:06,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,093 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:06,093 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1202289061, now seen corresponding path program 1 times [2019-10-15 01:28:06,094 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079980038] [2019-10-15 01:28:06,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:06,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079980038] [2019-10-15 01:28:06,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958600969] [2019-10-15 01:28:06,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,240 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-15 01:28:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,452 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-15 01:28:06,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-15 01:28:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,456 INFO L225 Difference]: With dead ends: 498 [2019-10-15 01:28:06,456 INFO L226 Difference]: Without dead ends: 264 [2019-10-15 01:28:06,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-15 01:28:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-15 01:28:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-15 01:28:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-15 01:28:06,483 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-15 01:28:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,483 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-15 01:28:06,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-15 01:28:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:28:06,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,487 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:06,488 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1597952639, now seen corresponding path program 1 times [2019-10-15 01:28:06,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996108832] [2019-10-15 01:28:06,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:06,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996108832] [2019-10-15 01:28:06,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:06,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:06,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69982283] [2019-10-15 01:28:06,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:06,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:06,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:06,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:06,614 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-15 01:28:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:06,944 INFO L93 Difference]: Finished difference Result 558 states and 938 transitions. [2019-10-15 01:28:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:06,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-15 01:28:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:06,947 INFO L225 Difference]: With dead ends: 558 [2019-10-15 01:28:06,948 INFO L226 Difference]: Without dead ends: 309 [2019-10-15 01:28:06,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-15 01:28:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2019-10-15 01:28:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 01:28:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-15 01:28:06,962 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-15 01:28:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:06,963 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-15 01:28:06,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-15 01:28:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:28:06,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:06,965 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-15 01:28:06,965 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:06,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2044645757, now seen corresponding path program 1 times [2019-10-15 01:28:06,966 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:06,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816216179] [2019-10-15 01:28:06,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:06,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:07,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816216179] [2019-10-15 01:28:07,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895416817] [2019-10-15 01:28:07,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,038 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-15 01:28:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,235 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-15 01:28:07,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-15 01:28:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,238 INFO L225 Difference]: With dead ends: 597 [2019-10-15 01:28:07,238 INFO L226 Difference]: Without dead ends: 306 [2019-10-15 01:28:07,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-15 01:28:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-15 01:28:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-15 01:28:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-15 01:28:07,259 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-15 01:28:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,267 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-15 01:28:07,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,267 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-15 01:28:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:28:07,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,269 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:07,269 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,270 INFO L82 PathProgramCache]: Analyzing trace with hash -176213692, now seen corresponding path program 1 times [2019-10-15 01:28:07,270 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056412137] [2019-10-15 01:28:07,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:07,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056412137] [2019-10-15 01:28:07,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614077463] [2019-10-15 01:28:07,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,373 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-15 01:28:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,600 INFO L93 Difference]: Finished difference Result 600 states and 1002 transitions. [2019-10-15 01:28:07,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-15 01:28:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,603 INFO L225 Difference]: With dead ends: 600 [2019-10-15 01:28:07,604 INFO L226 Difference]: Without dead ends: 307 [2019-10-15 01:28:07,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-15 01:28:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2019-10-15 01:28:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-15 01:28:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-15 01:28:07,617 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-15 01:28:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,617 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-15 01:28:07,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-15 01:28:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:28:07,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,619 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:07,619 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash -690895868, now seen corresponding path program 1 times [2019-10-15 01:28:07,620 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305875233] [2019-10-15 01:28:07,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-15 01:28:07,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305875233] [2019-10-15 01:28:07,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090203605] [2019-10-15 01:28:07,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,666 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-15 01:28:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,820 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-15 01:28:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:07,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-15 01:28:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,822 INFO L225 Difference]: With dead ends: 600 [2019-10-15 01:28:07,822 INFO L226 Difference]: Without dead ends: 311 [2019-10-15 01:28:07,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-15 01:28:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-15 01:28:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-15 01:28:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-15 01:28:07,838 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-15 01:28:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,839 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-15 01:28:07,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-15 01:28:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:28:07,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,840 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2019-10-15 01:28:07,841 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:07,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1568096766, now seen corresponding path program 1 times [2019-10-15 01:28:07,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:07,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206315343] [2019-10-15 01:28:07,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:07,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:07,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206315343] [2019-10-15 01:28:07,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:07,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:07,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160732188] [2019-10-15 01:28:07,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:07,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:07,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:07,909 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-15 01:28:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,123 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-15 01:28:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:08,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-15 01:28:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,125 INFO L225 Difference]: With dead ends: 640 [2019-10-15 01:28:08,126 INFO L226 Difference]: Without dead ends: 342 [2019-10-15 01:28:08,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-15 01:28:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-15 01:28:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-15 01:28:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-15 01:28:08,141 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-15 01:28:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,142 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-15 01:28:08,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-15 01:28:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:28:08,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,144 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:08,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash -314967930, now seen corresponding path program 1 times [2019-10-15 01:28:08,145 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356613599] [2019-10-15 01:28:08,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:08,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356613599] [2019-10-15 01:28:08,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:08,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633686691] [2019-10-15 01:28:08,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:08,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:08,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:08,216 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-15 01:28:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,407 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-15 01:28:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:08,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-15 01:28:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,409 INFO L225 Difference]: With dead ends: 669 [2019-10-15 01:28:08,410 INFO L226 Difference]: Without dead ends: 342 [2019-10-15 01:28:08,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-15 01:28:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-15 01:28:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-15 01:28:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-15 01:28:08,424 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-15 01:28:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,425 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-15 01:28:08,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-15 01:28:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:08,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,427 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:08,427 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1055150734, now seen corresponding path program 1 times [2019-10-15 01:28:08,428 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782271865] [2019-10-15 01:28:08,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:08,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782271865] [2019-10-15 01:28:08,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:08,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120803981] [2019-10-15 01:28:08,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:08,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:08,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:08,493 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-15 01:28:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,697 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-15 01:28:08,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:08,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,700 INFO L225 Difference]: With dead ends: 702 [2019-10-15 01:28:08,700 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 01:28:08,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 01:28:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-15 01:28:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-15 01:28:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-15 01:28:08,733 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-15 01:28:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:08,734 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-15 01:28:08,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-15 01:28:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:08,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:08,736 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:08,736 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2124208522, now seen corresponding path program 1 times [2019-10-15 01:28:08,737 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579283920] [2019-10-15 01:28:08,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:28:08,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579283920] [2019-10-15 01:28:08,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:08,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788379750] [2019-10-15 01:28:08,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:08,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:08,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:08,796 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-15 01:28:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,004 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-15 01:28:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:09,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,008 INFO L225 Difference]: With dead ends: 729 [2019-10-15 01:28:09,008 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 01:28:09,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 01:28:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-15 01:28:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-15 01:28:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-15 01:28:09,026 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-15 01:28:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-15 01:28:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-15 01:28:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:28:09,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,028 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:09,028 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1027752783, now seen corresponding path program 1 times [2019-10-15 01:28:09,029 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071627710] [2019-10-15 01:28:09,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:28:09,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071627710] [2019-10-15 01:28:09,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:09,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030293197] [2019-10-15 01:28:09,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:09,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:09,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:09,110 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-15 01:28:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,358 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-10-15 01:28:09,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:09,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-15 01:28:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,362 INFO L225 Difference]: With dead ends: 746 [2019-10-15 01:28:09,362 INFO L226 Difference]: Without dead ends: 392 [2019-10-15 01:28:09,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-15 01:28:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-15 01:28:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-15 01:28:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-15 01:28:09,381 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-15 01:28:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,381 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-15 01:28:09,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-15 01:28:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:28:09,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,383 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:09,384 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1923701177, now seen corresponding path program 1 times [2019-10-15 01:28:09,384 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629095382] [2019-10-15 01:28:09,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:28:09,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629095382] [2019-10-15 01:28:09,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:09,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760709558] [2019-10-15 01:28:09,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:09,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:09,449 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-15 01:28:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,680 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-10-15 01:28:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:09,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-15 01:28:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,683 INFO L225 Difference]: With dead ends: 767 [2019-10-15 01:28:09,684 INFO L226 Difference]: Without dead ends: 392 [2019-10-15 01:28:09,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-15 01:28:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-15 01:28:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-15 01:28:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-15 01:28:09,703 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-15 01:28:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,704 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-15 01:28:09,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-15 01:28:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:28:09,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,706 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-15 01:28:09,706 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1132457392, now seen corresponding path program 1 times [2019-10-15 01:28:09,707 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603337341] [2019-10-15 01:28:09,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:28:09,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603337341] [2019-10-15 01:28:09,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:09,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947750574] [2019-10-15 01:28:09,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:09,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:09,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,760 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-15 01:28:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,808 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-15 01:28:09,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:09,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-15 01:28:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,813 INFO L225 Difference]: With dead ends: 763 [2019-10-15 01:28:09,813 INFO L226 Difference]: Without dead ends: 761 [2019-10-15 01:28:09,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-15 01:28:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-15 01:28:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-15 01:28:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-15 01:28:09,849 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-15 01:28:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,849 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-15 01:28:09,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-15 01:28:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:28:09,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,852 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-15 01:28:09,852 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1143263811, now seen corresponding path program 1 times [2019-10-15 01:28:09,853 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416228716] [2019-10-15 01:28:09,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 01:28:09,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416228716] [2019-10-15 01:28:09,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:09,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435974908] [2019-10-15 01:28:09,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:09,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:09,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,902 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-15 01:28:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,973 INFO L93 Difference]: Finished difference Result 1837 states and 2905 transitions. [2019-10-15 01:28:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:09,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-15 01:28:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,983 INFO L225 Difference]: With dead ends: 1837 [2019-10-15 01:28:09,983 INFO L226 Difference]: Without dead ends: 1089 [2019-10-15 01:28:09,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-15 01:28:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2019-10-15 01:28:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-10-15 01:28:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1718 transitions. [2019-10-15 01:28:10,046 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1718 transitions. Word has length 127 [2019-10-15 01:28:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,047 INFO L462 AbstractCegarLoop]: Abstraction has 1089 states and 1718 transitions. [2019-10-15 01:28:10,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1718 transitions. [2019-10-15 01:28:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:28:10,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,050 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-15 01:28:10,050 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,051 INFO L82 PathProgramCache]: Analyzing trace with hash 733219007, now seen corresponding path program 1 times [2019-10-15 01:28:10,051 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817794328] [2019-10-15 01:28:10,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:28:10,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817794328] [2019-10-15 01:28:10,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:10,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942509377] [2019-10-15 01:28:10,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:10,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:10,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,116 INFO L87 Difference]: Start difference. First operand 1089 states and 1718 transitions. Second operand 3 states. [2019-10-15 01:28:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,214 INFO L93 Difference]: Finished difference Result 2534 states and 4005 transitions. [2019-10-15 01:28:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:10,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-15 01:28:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,223 INFO L225 Difference]: With dead ends: 2534 [2019-10-15 01:28:10,224 INFO L226 Difference]: Without dead ends: 1458 [2019-10-15 01:28:10,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2019-10-15 01:28:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2019-10-15 01:28:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-10-15 01:28:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2300 transitions. [2019-10-15 01:28:10,294 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2300 transitions. Word has length 127 [2019-10-15 01:28:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,295 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 2300 transitions. [2019-10-15 01:28:10,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2300 transitions. [2019-10-15 01:28:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:28:10,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,299 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-15 01:28:10,299 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2122513021, now seen corresponding path program 1 times [2019-10-15 01:28:10,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004416533] [2019-10-15 01:28:10,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-15 01:28:10,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004416533] [2019-10-15 01:28:10,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:10,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051695390] [2019-10-15 01:28:10,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:10,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:10,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,337 INFO L87 Difference]: Start difference. First operand 1458 states and 2300 transitions. Second operand 3 states. [2019-10-15 01:28:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,435 INFO L93 Difference]: Finished difference Result 3254 states and 5138 transitions. [2019-10-15 01:28:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:10,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-15 01:28:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,446 INFO L225 Difference]: With dead ends: 3254 [2019-10-15 01:28:10,446 INFO L226 Difference]: Without dead ends: 1809 [2019-10-15 01:28:10,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2019-10-15 01:28:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2019-10-15 01:28:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-10-15 01:28:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2851 transitions. [2019-10-15 01:28:10,526 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2851 transitions. Word has length 127 [2019-10-15 01:28:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,527 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 2851 transitions. [2019-10-15 01:28:10,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2851 transitions. [2019-10-15 01:28:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-15 01:28:10,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,532 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:10,533 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 913291395, now seen corresponding path program 1 times [2019-10-15 01:28:10,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538684144] [2019-10-15 01:28:10,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-15 01:28:10,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538684144] [2019-10-15 01:28:10,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:10,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135982960] [2019-10-15 01:28:10,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:10,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:10,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,640 INFO L87 Difference]: Start difference. First operand 1809 states and 2851 transitions. Second operand 3 states. [2019-10-15 01:28:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,874 INFO L93 Difference]: Finished difference Result 3655 states and 5745 transitions. [2019-10-15 01:28:10,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:10,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-15 01:28:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,884 INFO L225 Difference]: With dead ends: 3655 [2019-10-15 01:28:10,884 INFO L226 Difference]: Without dead ends: 1859 [2019-10-15 01:28:10,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-10-15 01:28:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1809. [2019-10-15 01:28:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-10-15 01:28:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2779 transitions. [2019-10-15 01:28:10,987 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2779 transitions. Word has length 204 [2019-10-15 01:28:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,987 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 2779 transitions. [2019-10-15 01:28:10,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2779 transitions. [2019-10-15 01:28:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-15 01:28:10,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,995 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:10,996 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash -555522276, now seen corresponding path program 1 times [2019-10-15 01:28:10,996 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029394031] [2019-10-15 01:28:10,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-15 01:28:11,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029394031] [2019-10-15 01:28:11,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:11,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124155242] [2019-10-15 01:28:11,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:11,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:11,072 INFO L87 Difference]: Start difference. First operand 1809 states and 2779 transitions. Second operand 3 states. [2019-10-15 01:28:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,312 INFO L93 Difference]: Finished difference Result 3704 states and 5669 transitions. [2019-10-15 01:28:11,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:11,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-15 01:28:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,323 INFO L225 Difference]: With dead ends: 3704 [2019-10-15 01:28:11,323 INFO L226 Difference]: Without dead ends: 1908 [2019-10-15 01:28:11,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-10-15 01:28:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1815. [2019-10-15 01:28:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2019-10-15 01:28:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2712 transitions. [2019-10-15 01:28:11,396 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2712 transitions. Word has length 218 [2019-10-15 01:28:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,397 INFO L462 AbstractCegarLoop]: Abstraction has 1815 states and 2712 transitions. [2019-10-15 01:28:11,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2712 transitions. [2019-10-15 01:28:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-15 01:28:11,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,403 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 01:28:11,403 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2121219740, now seen corresponding path program 1 times [2019-10-15 01:28:11,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751277905] [2019-10-15 01:28:11,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-15 01:28:11,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751277905] [2019-10-15 01:28:11,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407428166] [2019-10-15 01:28:11,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:11,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-15 01:28:11,802 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-15 01:28:11,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [449294849] [2019-10-15 01:28:11,885 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 238 [2019-10-15 01:28:11,928 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:11,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:13,597 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:13,600 INFO L272 AbstractInterpreter]: Visited 76 different actions 1155 times. Merged at 65 different actions 976 times. Widened at 11 different actions 96 times. Performed 2689 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2689 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 99 fixpoints after 14 different actions. Largest state had 94 variables. [2019-10-15 01:28:13,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,608 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:13,608 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:13,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:13,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645842392] [2019-10-15 01:28:13,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:13,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:13,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:13,611 INFO L87 Difference]: Start difference. First operand 1815 states and 2712 transitions. Second operand 6 states. [2019-10-15 01:28:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,151 INFO L93 Difference]: Finished difference Result 4312 states and 6397 transitions. [2019-10-15 01:28:14,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:14,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-10-15 01:28:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,164 INFO L225 Difference]: With dead ends: 4312 [2019-10-15 01:28:14,164 INFO L226 Difference]: Without dead ends: 2483 [2019-10-15 01:28:14,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2019-10-15 01:28:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1641. [2019-10-15 01:28:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-10-15 01:28:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2418 transitions. [2019-10-15 01:28:14,257 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2418 transitions. Word has length 237 [2019-10-15 01:28:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,257 INFO L462 AbstractCegarLoop]: Abstraction has 1641 states and 2418 transitions. [2019-10-15 01:28:14,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2418 transitions. [2019-10-15 01:28:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-15 01:28:14,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,264 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 01:28:14,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:14,471 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash 499648914, now seen corresponding path program 1 times [2019-10-15 01:28:14,471 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343790170] [2019-10-15 01:28:14,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-15 01:28:14,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343790170] [2019-10-15 01:28:14,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:14,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62548340] [2019-10-15 01:28:14,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:14,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:14,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:14,558 INFO L87 Difference]: Start difference. First operand 1641 states and 2418 transitions. Second operand 3 states. [2019-10-15 01:28:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,849 INFO L93 Difference]: Finished difference Result 3442 states and 5085 transitions. [2019-10-15 01:28:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:14,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-15 01:28:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,858 INFO L225 Difference]: With dead ends: 3442 [2019-10-15 01:28:14,859 INFO L226 Difference]: Without dead ends: 1726 [2019-10-15 01:28:14,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-10-15 01:28:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1716. [2019-10-15 01:28:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-10-15 01:28:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2483 transitions. [2019-10-15 01:28:14,932 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2483 transitions. Word has length 246 [2019-10-15 01:28:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,933 INFO L462 AbstractCegarLoop]: Abstraction has 1716 states and 2483 transitions. [2019-10-15 01:28:14,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2483 transitions. [2019-10-15 01:28:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-15 01:28:14,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,939 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:14,939 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1931626416, now seen corresponding path program 1 times [2019-10-15 01:28:14,940 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441656342] [2019-10-15 01:28:14,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:15,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441656342] [2019-10-15 01:28:15,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713183565] [2019-10-15 01:28:15,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:15,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:15,268 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-15 01:28:15,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2097591455] [2019-10-15 01:28:15,378 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 259 [2019-10-15 01:28:15,386 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:15,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:16,469 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:16,470 INFO L272 AbstractInterpreter]: Visited 77 different actions 1280 times. Merged at 66 different actions 1079 times. Widened at 11 different actions 97 times. Performed 2989 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2989 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 118 fixpoints after 17 different actions. Largest state had 94 variables. [2019-10-15 01:28:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,470 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:16,471 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:16,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:16,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455019785] [2019-10-15 01:28:16,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:16,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:16,473 INFO L87 Difference]: Start difference. First operand 1716 states and 2483 transitions. Second operand 6 states. [2019-10-15 01:28:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,418 INFO L93 Difference]: Finished difference Result 7747 states and 11324 transitions. [2019-10-15 01:28:17,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:28:17,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-10-15 01:28:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,446 INFO L225 Difference]: With dead ends: 7747 [2019-10-15 01:28:17,447 INFO L226 Difference]: Without dead ends: 6076 [2019-10-15 01:28:17,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2019-10-15 01:28:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 2394. [2019-10-15 01:28:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2019-10-15 01:28:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3181 transitions. [2019-10-15 01:28:17,581 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3181 transitions. Word has length 258 [2019-10-15 01:28:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,581 INFO L462 AbstractCegarLoop]: Abstraction has 2394 states and 3181 transitions. [2019-10-15 01:28:17,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3181 transitions. [2019-10-15 01:28:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-15 01:28:17,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,589 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:17,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:17,792 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2074521490, now seen corresponding path program 1 times [2019-10-15 01:28:17,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079384184] [2019-10-15 01:28:17,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-15 01:28:17,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079384184] [2019-10-15 01:28:17,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:17,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167144607] [2019-10-15 01:28:17,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:17,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:17,907 INFO L87 Difference]: Start difference. First operand 2394 states and 3181 transitions. Second operand 3 states. [2019-10-15 01:28:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,049 INFO L93 Difference]: Finished difference Result 6570 states and 8712 transitions. [2019-10-15 01:28:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:18,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-15 01:28:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,087 INFO L225 Difference]: With dead ends: 6570 [2019-10-15 01:28:18,087 INFO L226 Difference]: Without dead ends: 4221 [2019-10-15 01:28:18,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2019-10-15 01:28:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4219. [2019-10-15 01:28:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4219 states. [2019-10-15 01:28:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 5586 transitions. [2019-10-15 01:28:18,357 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 5586 transitions. Word has length 258 [2019-10-15 01:28:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,357 INFO L462 AbstractCegarLoop]: Abstraction has 4219 states and 5586 transitions. [2019-10-15 01:28:18,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 5586 transitions. [2019-10-15 01:28:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-15 01:28:18,375 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,375 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 01:28:18,375 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,376 INFO L82 PathProgramCache]: Analyzing trace with hash -381613367, now seen corresponding path program 1 times [2019-10-15 01:28:18,376 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598953288] [2019-10-15 01:28:18,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-15 01:28:18,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598953288] [2019-10-15 01:28:18,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:18,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445224915] [2019-10-15 01:28:18,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:18,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,465 INFO L87 Difference]: Start difference. First operand 4219 states and 5586 transitions. Second operand 3 states. [2019-10-15 01:28:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,775 INFO L93 Difference]: Finished difference Result 8631 states and 11424 transitions. [2019-10-15 01:28:18,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:18,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-15 01:28:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,787 INFO L225 Difference]: With dead ends: 8631 [2019-10-15 01:28:18,788 INFO L226 Difference]: Without dead ends: 4457 [2019-10-15 01:28:18,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2019-10-15 01:28:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 4219. [2019-10-15 01:28:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4219 states. [2019-10-15 01:28:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 5514 transitions. [2019-10-15 01:28:18,979 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 5514 transitions. Word has length 261 [2019-10-15 01:28:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,980 INFO L462 AbstractCegarLoop]: Abstraction has 4219 states and 5514 transitions. [2019-10-15 01:28:18,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 5514 transitions. [2019-10-15 01:28:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-15 01:28:18,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,991 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2019-10-15 01:28:18,991 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash 281332617, now seen corresponding path program 1 times [2019-10-15 01:28:18,992 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680078358] [2019-10-15 01:28:18,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-10-15 01:28:19,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680078358] [2019-10-15 01:28:19,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:19,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813437413] [2019-10-15 01:28:19,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:19,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:19,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:19,136 INFO L87 Difference]: Start difference. First operand 4219 states and 5514 transitions. Second operand 3 states. [2019-10-15 01:28:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,381 INFO L93 Difference]: Finished difference Result 8525 states and 11126 transitions. [2019-10-15 01:28:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:19,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-10-15 01:28:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,390 INFO L225 Difference]: With dead ends: 8525 [2019-10-15 01:28:19,390 INFO L226 Difference]: Without dead ends: 4351 [2019-10-15 01:28:19,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2019-10-15 01:28:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 4311. [2019-10-15 01:28:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-10-15 01:28:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5626 transitions. [2019-10-15 01:28:19,558 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5626 transitions. Word has length 295 [2019-10-15 01:28:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,558 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 5626 transitions. [2019-10-15 01:28:19,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5626 transitions. [2019-10-15 01:28:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-15 01:28:19,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,568 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2019-10-15 01:28:19,568 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1099840201, now seen corresponding path program 1 times [2019-10-15 01:28:19,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041411024] [2019-10-15 01:28:19,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-10-15 01:28:19,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041411024] [2019-10-15 01:28:19,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:19,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123580937] [2019-10-15 01:28:19,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:19,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:19,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:19,682 INFO L87 Difference]: Start difference. First operand 4311 states and 5626 transitions. Second operand 3 states. [2019-10-15 01:28:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,950 INFO L93 Difference]: Finished difference Result 8957 states and 11724 transitions. [2019-10-15 01:28:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:19,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-10-15 01:28:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,960 INFO L225 Difference]: With dead ends: 8957 [2019-10-15 01:28:19,961 INFO L226 Difference]: Without dead ends: 4691 [2019-10-15 01:28:19,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2019-10-15 01:28:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4561. [2019-10-15 01:28:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4561 states. [2019-10-15 01:28:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 5926 transitions. [2019-10-15 01:28:20,163 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 5926 transitions. Word has length 316 [2019-10-15 01:28:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,164 INFO L462 AbstractCegarLoop]: Abstraction has 4561 states and 5926 transitions. [2019-10-15 01:28:20,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 5926 transitions. [2019-10-15 01:28:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-15 01:28:20,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,174 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-10-15 01:28:20,174 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1319175701, now seen corresponding path program 1 times [2019-10-15 01:28:20,175 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588473701] [2019-10-15 01:28:20,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-15 01:28:20,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588473701] [2019-10-15 01:28:20,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:20,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:20,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949838258] [2019-10-15 01:28:20,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:20,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:20,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:20,286 INFO L87 Difference]: Start difference. First operand 4561 states and 5926 transitions. Second operand 3 states. [2019-10-15 01:28:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,477 INFO L93 Difference]: Finished difference Result 7673 states and 9899 transitions. [2019-10-15 01:28:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:20,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-15 01:28:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,483 INFO L225 Difference]: With dead ends: 7673 [2019-10-15 01:28:20,484 INFO L226 Difference]: Without dead ends: 2513 [2019-10-15 01:28:20,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2019-10-15 01:28:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2513. [2019-10-15 01:28:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-10-15 01:28:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3236 transitions. [2019-10-15 01:28:20,573 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3236 transitions. Word has length 326 [2019-10-15 01:28:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,573 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3236 transitions. [2019-10-15 01:28:20,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3236 transitions. [2019-10-15 01:28:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-15 01:28:20,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,581 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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-10-15 01:28:20,581 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash -231239372, now seen corresponding path program 1 times [2019-10-15 01:28:20,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638520197] [2019-10-15 01:28:20,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-15 01:28:20,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638520197] [2019-10-15 01:28:20,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:20,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:20,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604912430] [2019-10-15 01:28:20,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:20,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:20,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:20,744 INFO L87 Difference]: Start difference. First operand 2513 states and 3236 transitions. Second operand 3 states. [2019-10-15 01:28:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,974 INFO L93 Difference]: Finished difference Result 5021 states and 6470 transitions. [2019-10-15 01:28:20,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:20,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-10-15 01:28:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,979 INFO L225 Difference]: With dead ends: 5021 [2019-10-15 01:28:20,979 INFO L226 Difference]: Without dead ends: 2553 [2019-10-15 01:28:20,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-10-15 01:28:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2513. [2019-10-15 01:28:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-10-15 01:28:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3211 transitions. [2019-10-15 01:28:21,062 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3211 transitions. Word has length 342 [2019-10-15 01:28:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,062 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3211 transitions. [2019-10-15 01:28:21,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3211 transitions. [2019-10-15 01:28:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-15 01:28:21,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,069 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2019-10-15 01:28:21,069 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash -516641400, now seen corresponding path program 1 times [2019-10-15 01:28:21,070 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605517197] [2019-10-15 01:28:21,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-15 01:28:21,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605517197] [2019-10-15 01:28:21,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:21,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:21,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192783417] [2019-10-15 01:28:21,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:21,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:21,190 INFO L87 Difference]: Start difference. First operand 2513 states and 3211 transitions. Second operand 3 states. [2019-10-15 01:28:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,380 INFO L93 Difference]: Finished difference Result 4991 states and 6365 transitions. [2019-10-15 01:28:21,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:21,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-15 01:28:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,387 INFO L225 Difference]: With dead ends: 4991 [2019-10-15 01:28:21,388 INFO L226 Difference]: Without dead ends: 2523 [2019-10-15 01:28:21,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2019-10-15 01:28:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2513. [2019-10-15 01:28:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-10-15 01:28:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3186 transitions. [2019-10-15 01:28:21,476 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3186 transitions. Word has length 365 [2019-10-15 01:28:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,477 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3186 transitions. [2019-10-15 01:28:21,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3186 transitions. [2019-10-15 01:28:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-15 01:28:21,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,483 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:21,483 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash -753815824, now seen corresponding path program 1 times [2019-10-15 01:28:21,486 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878325242] [2019-10-15 01:28:21,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-15 01:28:21,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878325242] [2019-10-15 01:28:21,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688459462] [2019-10-15 01:28:21,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:21,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-15 01:28:22,014 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-15 01:28:22,119 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:22,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:22,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913375983] [2019-10-15 01:28:22,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:22,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:22,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:22,121 INFO L87 Difference]: Start difference. First operand 2513 states and 3186 transitions. Second operand 3 states. [2019-10-15 01:28:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,203 INFO L93 Difference]: Finished difference Result 3115 states and 3954 transitions. [2019-10-15 01:28:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:22,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-10-15 01:28:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,211 INFO L225 Difference]: With dead ends: 3115 [2019-10-15 01:28:22,212 INFO L226 Difference]: Without dead ends: 2977 [2019-10-15 01:28:22,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2019-10-15 01:28:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2377. [2019-10-15 01:28:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2019-10-15 01:28:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3032 transitions. [2019-10-15 01:28:22,350 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3032 transitions. Word has length 398 [2019-10-15 01:28:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,351 INFO L462 AbstractCegarLoop]: Abstraction has 2377 states and 3032 transitions. [2019-10-15 01:28:22,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3032 transitions. [2019-10-15 01:28:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-10-15 01:28:22,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,356 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:22,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:22,571 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1467408517, now seen corresponding path program 1 times [2019-10-15 01:28:22,572 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487282200] [2019-10-15 01:28:22,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-15 01:28:22,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487282200] [2019-10-15 01:28:22,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462585204] [2019-10-15 01:28:22,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:22,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-15 01:28:22,973 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-15 01:28:23,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2131404236] [2019-10-15 01:28:23,120 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 415 [2019-10-15 01:28:23,124 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:23,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:23,174 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:24,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:24,344 INFO L272 AbstractInterpreter]: Visited 99 different actions 2124 times. Merged at 85 different actions 1775 times. Widened at 19 different actions 260 times. Performed 4827 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 213 fixpoints after 20 different actions. Largest state had 97 variables. [2019-10-15 01:28:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,344 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:24,344 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:24,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:24,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648427391] [2019-10-15 01:28:24,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:24,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:24,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:24,347 INFO L87 Difference]: Start difference. First operand 2377 states and 3032 transitions. Second operand 6 states. [2019-10-15 01:28:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,856 INFO L93 Difference]: Finished difference Result 5666 states and 7218 transitions. [2019-10-15 01:28:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:24,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 414 [2019-10-15 01:28:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,862 INFO L225 Difference]: With dead ends: 5666 [2019-10-15 01:28:24,863 INFO L226 Difference]: Without dead ends: 3285 [2019-10-15 01:28:24,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-10-15 01:28:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2437. [2019-10-15 01:28:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-10-15 01:28:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3107 transitions. [2019-10-15 01:28:24,959 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3107 transitions. Word has length 414 [2019-10-15 01:28:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,960 INFO L462 AbstractCegarLoop]: Abstraction has 2437 states and 3107 transitions. [2019-10-15 01:28:24,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3107 transitions. [2019-10-15 01:28:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-10-15 01:28:24,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,967 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:25,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:25,176 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 540711013, now seen corresponding path program 1 times [2019-10-15 01:28:25,178 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676762375] [2019-10-15 01:28:25,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1661 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-10-15 01:28:25,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676762375] [2019-10-15 01:28:25,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:25,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:25,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966223525] [2019-10-15 01:28:25,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:25,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,607 INFO L87 Difference]: Start difference. First operand 2437 states and 3107 transitions. Second operand 3 states. [2019-10-15 01:28:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,798 INFO L93 Difference]: Finished difference Result 5009 states and 6387 transitions. [2019-10-15 01:28:25,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:25,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 542 [2019-10-15 01:28:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,803 INFO L225 Difference]: With dead ends: 5009 [2019-10-15 01:28:25,804 INFO L226 Difference]: Without dead ends: 2617 [2019-10-15 01:28:25,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-10-15 01:28:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2607. [2019-10-15 01:28:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-10-15 01:28:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3302 transitions. [2019-10-15 01:28:25,896 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3302 transitions. Word has length 542 [2019-10-15 01:28:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:25,897 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 3302 transitions. [2019-10-15 01:28:25,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3302 transitions. [2019-10-15 01:28:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-10-15 01:28:25,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:25,905 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:25,906 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash -995203399, now seen corresponding path program 1 times [2019-10-15 01:28:25,906 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578018890] [2019-10-15 01:28:25,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-15 01:28:26,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578018890] [2019-10-15 01:28:26,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160918350] [2019-10-15 01:28:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:26,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-15 01:28:26,530 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-15 01:28:26,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [729541740] [2019-10-15 01:28:26,735 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 605 [2019-10-15 01:28:26,738 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:26,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:26,795 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:27,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:27,998 INFO L272 AbstractInterpreter]: Visited 110 different actions 2364 times. Merged at 93 different actions 1923 times. Widened at 22 different actions 309 times. Performed 5625 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5625 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 268 fixpoints after 22 different actions. Largest state had 101 variables. [2019-10-15 01:28:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:27,998 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:27,998 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:27,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:27,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552354950] [2019-10-15 01:28:28,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:28,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:28,001 INFO L87 Difference]: Start difference. First operand 2607 states and 3302 transitions. Second operand 6 states. [2019-10-15 01:28:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:28,337 INFO L93 Difference]: Finished difference Result 4192 states and 5300 transitions. [2019-10-15 01:28:28,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:28,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 604 [2019-10-15 01:28:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:28,339 INFO L225 Difference]: With dead ends: 4192 [2019-10-15 01:28:28,339 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:28,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1215 GetRequests, 1209 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:28,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 604 [2019-10-15 01:28:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:28,347 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:28,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:28,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:28,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:28,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:28,695 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2019-10-15 01:28:29,101 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 132 [2019-10-15 01:28:29,282 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 146 [2019-10-15 01:28:30,204 WARN L191 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 301 [2019-10-15 01:28:30,914 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 448 DAG size of output: 301 [2019-10-15 01:28:32,197 WARN L191 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58 [2019-10-15 01:28:32,955 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 61